Geodesic cycles in random graphs

DOI10.1016/j.disc.2018.01.014zbMath1383.05293OpenAlexW2793821817MaRDI QIDQ1709524

Ling-Sheng Shi, Yuanzhi Li

Publication date: 5 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.01.014

zbMATH Keywords

hyperbolicrandom graphgeodesic cycle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the hyperbolicity of random graphs
• Long paths in sparse random graphs
• Locally geodesic cycles in 2-self-centered graphs
• An algorithm for finding Hamilton paths and cycles in random graphs
• Holes in random graphs
• The size of the largest hole in a random graph
• Geodesics and almost geodesic cycles in random regular graphs
• Emergence of Scaling in Random Networks
• The Diameter of Random Graphs
• Cycles in a random graph near the critical point
• Paths in graphs
• The Diameter of Sparse Random Graphs
• Random Graphs
• Models of the small world.
• The diameter of sparse random graphs

This page was built for publication: Geodesic cycles in random graphs