One-to-one disjoint path covers on multi-dimensional tori
From MaRDI portal
Publication:5248088
DOI10.1080/00207160.2014.940334zbMath1310.05190OpenAlexW2078543256MaRDI QIDQ5248088
Yuxing Yang, Di Liu, Jing Li, Jun Yuan
Publication date: 27 April 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.940334
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Connectivity (05C40)
Related Items (6)
Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ An efficient algorithm to construct disjoint path covers of DCell networks ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ Super spanning connectivity of split-star networks ⋮ The Super Spanning Connectivity of Arrangement Graphs
Cites Work
- One-to-many node-disjoint paths of hyper-star networks
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
- The super laceability of the hypercubes
- The spanning connectivity of folded hypercubes
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Edge-disjoint spanners in tori
- An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
- The super-connected property of recursive circulant graphs
- Single-source three-disjoint path covers in cubes of connected graphs
- General-demand disjoint path covers in a graph with faulty elements
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS
- Disjoint paths in hypercubes with prescribed origins and lengths
This page was built for publication: One-to-one disjoint path covers on multi-dimensional tori