Infinite Limits of Copying Models of the Web Graph

DOI10.1080/15427951.2004.10129087zbMath1080.05084OpenAlexW2014807292MaRDI QIDQ4665448

Anthony Bonato, Jeannette C. M. Janssen

Publication date: 11 April 2005

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

Full work available at URL: https://doi.org/10.1080/15427951.2004.10129087

zbMATH Keywords

infinite random graphsadjacency propertiesfractal property of a graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ An explicit construction of \((3,t)\)-existentially closed graphs ⋮ A Spatial Web Graph Model with Local Influence Regions ⋮ The diameter of protean graphs ⋮ Robustness of Preferential Attachment Under Deletion of Edges ⋮ Then-ordered graphs: A new graph class ⋮ Protean Graphs with a Variety of Ranking Schemes

This page was built for publication: Infinite Limits of Copying Models of the Web Graph