Two-disjoint-cycle-cover pancyclicity of data center networks
From MaRDI portal
Publication:6570972
DOI10.1016/j.amc.2024.128716zbMath1545.05181MaRDI QIDQ6570972
Xiao-Wen Qin, Jou-Ming Chang, Rong-xia Hao, Hui Zhang
Publication date: 11 July 2024
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- The restricted \(h\)-connectivity of the data center network DCell
- An efficient algorithm to construct disjoint path covers of DCell networks
- Survey on path and cycle embedding in some networks
- Conditional edge-fault-tolerant Hamiltonicity of the data center network
- The pessimistic diagnosability of data center networks
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- Two disjoint cycles of various lengths in alternating group graph
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- The vertex-pancyclicity of data center networks
- The \(k\)-restricted edge-connectivity of the data center network DCell
- Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
- Constructing dual-CISTs of DCell data center networks
- Strongly Menger connectedness of data center network and \((n,k)\)-star graph
- Fault diagnosability of data center networks
- Strongly Menger-edge-connectedness of DCell networks
- Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
- Component connectivity of the data center network dcell
- Graph Theory
- The Generalized Connectivity of Data Center Networks
- Super edge-connectivity and matching preclusion of data center networks
- Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
- Structure connectivity of data center networks
This page was built for publication: Two-disjoint-cycle-cover pancyclicity of data center networks
