𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Survival time of a random graph

✍ Scribed by A. M. Frieze; A. M. Frieze

Book ID
105470539
Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
393 KB
Volume
9
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Cover Time of Random Regular Graphs
The Cover Time of Random Regular Graphs
✍ Cooper, Colin; Frieze, Alan πŸ“‚ Article πŸ“… 2005 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 187 KB
The Flooding Time in Random Graphs
The Flooding Time in Random Graphs
✍ Remco Van Der Hofstad; Gerard Hooghiemstra; Piet van Mieghem πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 242 KB
Local connectivity of a random graph
Local connectivity of a random graph
✍ P. ErdΓΆs; E. M. Palmer; R. W. Robinson πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 255 KB

## Abstract A graph is locally connected if for each vertex Ξ½ of degree __≧2__, the subgraph induced by the vertices adjacent to Ξ½ is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_