Cycles, Paths, Connectivity and Diameter in Distance Graphs

DOI10.1007/978-3-642-11409-0_28zbMath1273.05120OpenAlexW1556887280MaRDI QIDQ5851116

Dieter Rautenbach, Jayme Luiz Szwarcfiter, Lucia Draque Penso

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_28

zbMATH Keywords

diameterconnectivityHamiltonian cycledistance graphHamiltonian pathcirculant graphmultiple loop networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On Hamiltonian paths in distance graphs

This page was built for publication: Cycles, Paths, Connectivity and Diameter in Distance Graphs