The vertex-pancyclicity of data center networks

DOI10.1016/j.tcs.2020.11.027zbMath1478.68243OpenAlexW3104076250MaRDI QIDQ2220882

Zeng-Xian Tian, Rong-xia Hao

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

Hamiltonian cyclepancyclicityvertex-pancyclicitydata center network

Mathematics Subject Classification ID

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

Related Items (2)

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

Uses Software

• MapReduce
• Dryad

Cites Work

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

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