# Random railways modeled as random 3-regular graphs

• Published in 1996
In the collections
In a cubic multigraph certain restrictions on the paths are made. Due to these restrictions a special kind of connectivity is defined. The asymptotic probability of this connectivity is calculated in a random cubic multigraph and is shown to be 1/3.

## Other information

key
Randomrailwaysmodeledasrandom3regulargraphs
type
article
2018-01-09
date_published
1996-02-02

### BibTeX entry

@article{Randomrailwaysmodeledasrandom3regulargraphs,
key = {Randomrailwaysmodeledasrandom3regulargraphs},
type = {article},
title = {Random railways modeled as random 3-regular graphs},
author = {Hans Garmo},
abstract = {In a cubic multigraph certain restrictions on the paths are made. Due to these restrictions a special kind of connectivity is defined. The asymptotic probability of this connectivity is calculated in a random cubic multigraph and is shown to be 1/3.},
comment = {},
}