Article contents
Asymptotic properties of the connectivity number of random railways
Published online by Cambridge University Press: 01 July 2016
Abstract
In a cubic multigraph certain restrictions on the paths are made to define what is called a railway. On the tracks in the railway (edges in the multigraph) an equivalence relation is defined. The number of equivalence classes induced by this relation is investigated for a random railway achieved from a random cubic multigraph, and the asymptotic distribution of this number is derived as the number of vertices tends to infinity.
MSC classification
- Type
- General Applied Probability
- Information
- Copyright
- Copyright © Applied Probability Trust 1999
References
- 2
- Cited by