Long Paths in Random Apollonian Networks
From MaRDI portal
Abstract: We consider the length of the longest path in a randomly generated Apollonian Network (ApN) . We show that w.h.p. for any constant .
Recommendations
- On longest paths and diameter in random Apollonian networks
- On certain properties of random Apollonian networks
- Distances in random Apollonian network structures
- Some properties of random Apollonian networks
- Long paths and connectivity in 1-independent random graphs
- Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees
- Longest paths in random hypergraphs
- Long paths in heterogeneous random subgraphs of graphs with large minimum degree
- scientific article; zbMATH DE number 4043893
- Length of optimal path in random networks with strong disorder
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
- On longest paths and diameter in random Apollonian networks
- The height of random k‐trees and related branching processes
Cited in
(3)
This page was built for publication: Long Paths in Random Apollonian Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985790)