Fault-free mutually independent Hamiltonian cycles of faulty star graphs
DOI10.1080/00207161003786614zbMATH Open1226.05148OpenAlexW2010180287MaRDI QIDQ2995474FDOQ2995474
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
Recommendations
- Conditional fault-tolerant Hamiltonicity of star graphs
- Cycle embedding in star graphs with more conditional faulty edges
- Cycle embedding in star graphs with edge faults
- Cycle embedding in star graphs with conditional edge faults
- Embedding cycles of various lengths into star graphs with both edge and vertex faults
Applications of graph theory (05C90) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Network design and communication in computer systems (68M10)
Cites Work
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- Hyper Hamiltonian laceability on edge fault star graph
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- On the fault-diameter of the star graph
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Hamiltonian-laceability of star graphs
- Advances on the Hamiltonian problem -- a survey
- Hamilton-connected Cayley graphs on Hamiltonian groups
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Longest paths and cycles in faulty star graphs
- On hamiltonicity of circulant digraphs of outdegree three
- Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- On Hamiltonicity of vertex-transitive graphs and digraphs of order \(p^4\)
- Automorphism groups with cyclic commutator subgroup and Hamilton cycles
- Hamiltonicity of vertex-transitive graphs of order 4\(p\)
- Hamiltonian cycles in vertex symmetric graphs of order \(2p^ 2\)
- On mutually independent Hamiltonian paths
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
- On the spanningw-wide diameter of the star graph
- On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
- The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
Cited In (7)
- On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
- Mutually independent hamiltonian paths in star networks
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
- Fault-free longest paths in star networks with conditional link faults
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
This page was built for publication: Fault-free mutually independent Hamiltonian cycles of faulty star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995474)
