Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)

DOI10.1016/J.AML.2009.06.010zbMath1177.05117OpenAlexW2049268761MaRDI QIDQ1036825

Dragan Stevanović, Aleksandar Ilić

Publication date: 13 November 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.06.010

zbMATH Keywords

graph algorithmbinary treediameterHamiltonian cycleHamiltonian graphstoken ring

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• The Diameter of a Cycle Plus a Random Matching
• Almost all regular graphs are hamiltonian
• An Explicit Construction of Lower-Diameter Cubic Graphs

This page was built for publication: Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\)