Two-disjoint-cycle-cover pancyclicity of data center networks

DOI10.1016/J.AMC.2024.128716MaRDI QIDQ6570972zbMATH OpenFDO

Authors Rong-Xia Hao, Xiao-Wen Qin, Hui Zhang, Jou-Ming Chang

Publication date 11 July 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

pancyclicityvertex-disjoint cyclesdata center networksdisjoint-cycle-cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The vertex-pancyclicity of data center networks
• Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
• Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
• Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes

Cites work

• An efficient algorithm to construct disjoint path covers of DCell networks
• Component connectivity of the data center network dcell
• Conditional edge-fault-tolerant Hamiltonicity of the data center network
• Constructing dual-CISTs of DCell data center networks
• Fault diagnosability of data center networks
• Graph theory
• Graph theory with applications
• Strongly Menger connectedness of data center network and \((n,k)\)-star graph
• Strongly Menger-edge-connectedness of DCell networks
• Structure connectivity of data center networks
• Super edge-connectivity and matching preclusion of data center networks
• Survey on path and cycle embedding in some networks
• The \(k\)-restricted edge-connectivity of the data center network DCell
• The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
• The generalized connectivity of data center networks
• The pessimistic diagnosability of data center networks
• The restricted \(h\)-connectivity of the data center network DCell
• The vertex-pancyclicity of data center networks
• Two disjoint cycles of various lengths in alternating group graph
• Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
• Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
• Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
• Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube

Cited in

(1)

• The disjoint path cover in the data center network HSDC with prescribed vertices in each path

This page was built for publication: Two-disjoint-cycle-cover pancyclicity of data center networks

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