Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs

DOI10.1016/j.mcm.2007.11.015zbMath1145.05312OpenAlexW1967288240MaRDI QIDQ949579

Tseng-Kui Li, Chang-Hsiung Tsai

Publication date: 21 October 2008

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2007.11.015

zbMATH Keywords

fault toleranceHamiltonian cycleinterconnection networkgraph theoremHamiltonian 1-node-Hamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Embedding Wheel - like Networks ⋮ On 4-ordered 3-regular graphs

Cites Work

• Unnamed Item
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• New flip-flop constructions for hypohamiltonian graphs
• Parallel concepts in graph theory
• Construction schemes for fault-tolerant Hamiltonian graphs
• Edge fault tolerance in graphs
• Flip-Flops in Hypohamiltonian Graphs

This page was built for publication: Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs