Fault-free mutually independent Hamiltonian cycles of faulty star graphs

DOI10.1080/00207161003786614MaRDI QIDQ2995474zbMATH OpenOpenAlexFDO

Authors Tzu-Liang Kung, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu

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) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Network design and communication in computer systems (68M10)

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

Cites work

scientific article; zbMATH DE number 52113 (Why is no real title available?)
A group-theoretic model for symmetric interconnection networks
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
Advances on the Hamiltonian problem -- a survey
Automorphism groups with cyclic commutator subgroup and Hamilton cycles
Edge-disjoint spanning trees on the star network with applications to fault tolerance
Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
Hamilton cycles and paths in vertex-transitive graphs-current directions
Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
Hamilton-connected Cayley graphs on Hamiltonian groups
Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
Hamiltonian cycles in vertex symmetric graphs of order \(2p^ 2\)
Hamiltonian-laceability of star graphs
Hamiltonicity of vertex-transitive graphs of order 4\(p\)
Hyper Hamiltonian laceability on edge fault star graph
Hyper-Hamilton laceable and caterpillar-spannable product graphs
Longest paths and cycles in faulty star graphs
Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
On Hamiltonicity of vertex-transitive graphs and digraphs of order \(p^4\)
On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
On hamiltonicity of circulant digraphs of outdegree three
On mutually independent Hamiltonian paths
On the fault-diameter of the star graph
On the spanningw-wide diameter of the star graph
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs

Cited in

(10)

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
Star graph automorphisms and disjoint Hamilton cycles
Disjoint Hamilton cycles in the star graph
Optimal bounds for disjoint Hamilton cycles in star graphs
Mutually independent hamiltonian paths in star networks
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
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
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization

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)