Mutually independent hamiltonian paths in star networks

DOI10.1002/NET.20078MaRDI QIDQ5318273zbMATH OpenOpenAlexFDO

Authors Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau

Publication date 22 September 2005

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20078

zbMATH Keywords

Hamiltonian connectedHamiltonian laceableHamiltonian pathinterconnection networksstar networks

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Mutually independent Hamiltonian connectivity of (n,k)-star graphs
• Hamiltonian-laceability of star graphs
• On mutually independent Hamiltonian paths
• Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs

Cited in

(11)

• Path embedding in star graphs
• Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
• Modelling simultaneous broadcasting by level-disjoint partitions
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• On cubic 2-independent Hamiltonian connected graphs
• On mutually independent Hamiltonian paths
• Star graph automorphisms and disjoint Hamilton cycles
• Hamiltonian-laceability of star graphs
• Mutually independent bipanconnected property of hypercube
• Mutually independent Hamiltonian connectivity of (n,k)-star graphs
• Rooted level-disjoint partitions of Cartesian products

This page was built for publication: Mutually independent hamiltonian paths in star networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318273)