Random minimum length spanning trees in regular graphs (Q1288911)
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: Random minimum length spanning trees in regular graphs |
scientific article; zbMATH DE number 1288356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random minimum length spanning trees in regular graphs |
scientific article; zbMATH DE number 1288356 |
Statements
Random minimum length spanning trees in regular graphs (English)
0 references
18 May 1999
0 references
For random graphs with edge lengths that are independently and uniformly distributed on the unit interval, the expected minimum length of a spanning forest is investigated. In particular, the expected minimum length of a spanning tree is given asymptotically for regular connected graphs.
0 references
expected minimum length
0 references
random spanning trees
0 references
random graphs
0 references
regular connected graphs
0 references
