Two spanning disjoint paths with required length in generalized hypercubes
From MaRDI portal
Publication:393111
DOI10.1016/j.tcs.2013.08.004zbMath1302.05091OpenAlexW1986597541MaRDI QIDQ393111
Dyi-Rong Duh, Yao-Chung Lin, Cheng-Nan Lai, Yue-Li Wang
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.004
Hypergraphs (05C65) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Related Items (3)
Extremal Results on Vertex and Link Residual Closeness ⋮ An efficient algorithm to construct disjoint path covers of DCell networks ⋮ Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
Cites Work
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Combinatorial properties of generalized hypercube graphs
- Panconnectivity of locally twisted cubes
- Hamiltonicity of hypercubes with a constraint of required and faulty edges
- Complete path embeddings in crossed cubes
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Generalized Hypercube and Hyperbus Structures for a Computer Network
This page was built for publication: Two spanning disjoint paths with required length in generalized hypercubes
