Long Paths in Random Apollonian Networks

DOI10.1080/15427951.2014.925524zbMath1465.05158arXiv1403.1472OpenAlexW2593823372WikidataQ57401411 ScholiaQ57401411MaRDI QIDQ4985790

Colin Cooper, Alan M. Frieze

Publication date: 26 April 2021

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

Full work available at URL: https://arxiv.org/abs/1403.1472

zbMATH Keywords

randomly generated Apollonian network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Long cycles in 3-connected graphs
• Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees
• On Certain Properties of Random Apollonian Networks
• The height of random k‐trees and related branching processes
• On longest paths and diameter in random apollonian networks