The vertex-pancyclicity of data center networks

DOI10.1016/J.TCS.2020.11.027MaRDI QIDQ2220882zbMATH OpenOpenAlexFDO

Authors Rong-Xia Hao, Zeng-Xian Tian

Publication date 25 January 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.11.027

zbMATH Keywords

data center networkHamiltonian cyclepancyclicityvertex-pancyclicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Conditional edge-fault-tolerant Hamiltonicity of the data center network
• On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
• Vertex-pancyclicity of the \((n,k)\)-bubble-sort networks
• Cycle embedding of augmented cubes
• On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes

Cites work

• Bipanconnectivity of balanced hypercubes
• Conditional edge-fault pancyclicity of augmented cubes
• Constructing dual-CISTs of DCell data center networks
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Edge-pancyclic block-intersection graphs
• Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
• scientific article; zbMATH DE number 3902696 (Why is no real title available?)
• Pancyclic graphs. I
• Strongly Menger connectedness of data center network and \((n,k)\)-star graph
• Survey on path and cycle embedding in some networks
• Task assignment in heterogeneous computing systems
• The pessimistic diagnosability of data center networks
• The restricted h-connectivity of the data center network DCell
• The square of a block is vertex pancyclic
• Vertex-pancyclicity of augmented cubes with maximal faulty edges

Cited in

(9)

• On the conjecture of vertex-transitivity of DCell
• The restricted h-connectivity of the data center network DCell
• Connectivity and constructive algorithms of disjoint paths in dragonfly networks
• The weakly dimension-balanced pancyclicity on toroidal mesh graph \(T_{m,n}\) When both \(m\) and \(n\) are odd
• Statistics of cycles: how loopy is your network?
• A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITY
• Two-disjoint-cycle-cover pancyclicity of data center networks
• Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
• 2-edge Hamiltonian connectedness: characterization and results in data center networks

Describes a project that uses

Uses Software

• MapReduce
• Dryad

This page was built for publication: The vertex-pancyclicity of data center networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220882)