One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
From MaRDI portal
Publication:638511
DOI10.1016/j.tcs.2011.04.035zbMath1223.68086OpenAlexW2013976694MaRDI QIDQ638511
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.035
Network design and communication in computer systems (68M10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Related Items (27)
Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes ⋮ A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ The disjoint path cover in the data center network HSDC with prescribed vertices in each path ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ An efficient algorithm to construct disjoint path covers of DCell networks ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ Super spanning connectivity on WK-recursive networks ⋮ One-to-one disjoint path covers in digraphs ⋮ Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ One-to-one disjoint path covers on alternating group graphs ⋮ Unnamed Item ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Vertex-disjoint paths joining adjacent vertices in faulty hypercubes ⋮ One-to-one disjoint path covers on multi-dimensional tori ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Cites Work
- Unnamed Item
- Disjoint cycles and spanning graphs of hypercubes
- Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
- Hamilton connected graphs
- Cycles embedding in hypercubes with node failures
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Globally bi-3*-connected graphs
- A survey of the theory of hypercube graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Node-disjoint paths in hierarchical hypercube networks
- Perfect matchings extend to Hamilton cycles in hypercubes
- On spanning connected graphs
- Cubic planar Hamiltonian graphs of various types
- Panconnectivity and edge-pancyclicity ofk-aryn-cubes
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Lee distance and topological properties of k-ary n-cubes
- Node‐disjoint paths and related problems on hierarchical cubic networks
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
This page was built for publication: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
