Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum (Q1320669)
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 on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum |
scientific article; zbMATH DE number 560988
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum |
scientific article; zbMATH DE number 560988 |
Statements
Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum (English)
0 references
18 May 1994
0 references
base spectrum
0 references
cycle matroid
0 references
lower bound
0 references
connectedness
0 references
random graph
0 references
trees
0 references
