Lower bounds of connectedness probability for some classes of random graphs (Q1310759)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds of connectedness probability for some classes of random graphs |
scientific article; zbMATH DE number 482599
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds of connectedness probability for some classes of random graphs |
scientific article; zbMATH DE number 482599 |
Statements
Lower bounds of connectedness probability for some classes of random graphs (English)
0 references
14 March 1994
0 references
The author considers a class of graphs which are composed by a sequence of similar parts with known characteristic size values. These size values are the basis of the lower estimates of the probability of connectivity given in the article.
0 references
probability
0 references
random graphs
0 references
connectivity
0 references
0.97128004
0 references
0.9438212
0 references
0.9431422
0 references
0 references
0 references
0.9229822
0 references
0.92270535
0 references
0 references
0.92065763
0 references
0.9200508
0 references
