On the construction of combinedk-fault-tolerant Hamiltonian graphs

DOI10.1002/net.6zbMath0974.05051OpenAlexW1929872735MaRDI QIDQ2719848

Chun-Nan Hung, Ting-Yi Sung, Lih-Hsing Hsu

Publication date: 12 December 2001

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

diameterHamiltonian graphnode expansion

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Edge, vertex and mixed fault diameters ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Lattice graphs with non-concurrent longest cycles ⋮ The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks

Cites Work

• Enclosing \(k\) points in the smallest axis parallel rectangle
• Arc coverings of graphs
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• MinimumK-hamiltonian graphs
• Minimumk-hamiltonian graphs, II
• Edge fault tolerance in graphs
• Unnamed Item

This page was built for publication: On the construction of combinedk-fault-tolerant Hamiltonian graphs