Growing Protean Graphs
From MaRDI portal
Publication:3622686
DOI10.1080/15427951.2007.10129135zbMath1167.05047OpenAlexW2034244548MaRDI QIDQ3622686
Paweł Prałat, Nicholas C. Wormald
Publication date: 28 April 2009
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2007.10129135
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Ordinary differential equations and systems with randomness (34F05) Connectivity (05C40) Vertex degrees (05C07)
Related Items (9)
Random 4-regular graphs have 3-star decompositions asymptotically almost surely ⋮ The Domination Number of On-line Social Networks and Random Geometric Graphs ⋮ On star decompositions of random regular graphs ⋮ The diameter of protean graphs ⋮ Connectivity threshold and recovery time in rank-based models for complex networks ⋮ Scale‐free graphs of increasing degree ⋮ Some Properties of Random Apollonian Networks ⋮ Protean graphs with a variety of ranking schemes ⋮ Protean Graphs with a Variety of Ranking Schemes
This page was built for publication: Growing Protean Graphs
