Fault-free mutually independent Hamiltonian cycles of faulty star graphs
From MaRDI portal
Publication:2995474
DOI10.1080/00207161003786614zbMath1226.05148OpenAlexW2010180287MaRDI QIDQ2995474
Tyne Liang, Tzu-Liang Kung, Jimmy J. M. Tan, Lih-Hsing Hsu, Cheng-Kuan Lin
Publication date: 21 April 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207161003786614
Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
Cites Work
- Unnamed Item
- Hamiltonian cycles in vertex symmetric graphs of order \(2p^ 2\)
- Longest paths and cycles in faulty star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- On hamiltonicity of circulant digraphs of outdegree three
- Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- On the fault-diameter of the star graph
- On Hamiltonicity of vertex-transitive graphs and digraphs of order \(p^4\)
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Advances on the Hamiltonian problem -- a survey
- Automorphism groups with cyclic commutator subgroup and Hamilton cycles
- On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
- Hamiltonicity of vertex-transitive graphs of order 4\(p\)
- On mutually independent Hamiltonian paths
- The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
- On the spanningw-wide diameter of the star graph
- A group-theoretic model for symmetric interconnection networks
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Hamiltonian-laceability of star graphs
- Hamilton-connected Cayley graphs on Hamiltonian groups
