Cycles, Paths, Connectivity and Diameter in Distance Graphs

DOI10.1007/978-3-642-11409-0_28MaRDI QIDQ5851116zbMATH OpenOpenAlexFDO

Authors Dieter Rautenbach, Lucia Draque Penso, Jayme L. Szwarcfiter

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

circulant graphconnectivitydiameterdistance graphHamiltonian cycleHamiltonian pathmultiple loop networks

Mathematics Subject Classification ID

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

Recommendations

• Connectivity and diameter in distance graphs
• scientific article; zbMATH DE number 6536189
• Long cycles and paths in distance graphs
• Connectivity and cycles in graphs
• Publication:4892348
• scientific article; zbMATH DE number 7509361
• On cycles in graphs with specified radius and diameter
• On the total distance and diameter of graphs
• Diameter of path graphs
• On the distance connectivity of graphs and digraphs

Cited in

(13)

• Connectivity and diameter in distance graphs
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• Special study on cycles through distance graph
• scientific article; zbMATH DE number 1332354 (Why is no real title available?)
• On cycles in graphs with specified radius and diameter
• scientific article; zbMATH DE number 1390064 (Why is no real title available?)
• Powers of cycles, powers of paths, and distance graphs
• On Hamiltonian paths in distance graphs
• Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
• Computer Algebra in Scientific Computing
• scientific article; zbMATH DE number 6471182 (Why is no real title available?)
• A linear algorithm for the distance in Cayley graph \(H_{\ell,p}\)
• Long cycles and paths in distance graphs

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

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