The diameter of protean graphs

DOI10.1016/j.disc.2007.06.025zbMath1153.05064OpenAlexW1968105630MaRDI QIDQ932616

Paweł Prałat

Publication date: 11 July 2008

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

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

zbMATH Keywords

random graphsgraph diametergiant componentprotean web graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

The Domination Number of On-line Social Networks and Random Geometric Graphs ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Connectivity threshold and recovery time in rank-based models for complex networks ⋮ Scale‐free graphs of increasing degree ⋮ Protean graphs with a variety of ranking schemes ⋮ Protean Graphs with a Variety of Ranking Schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Renormalization group analysis of the small-world network model
• Protean Graphs
• Growing Protean Graphs
• Infinite Limits of Copying Models of the Web Graph
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Rank-Based Attachment Leads to Power Law Graphs

This page was built for publication: The diameter of protean graphs