An infinite family of 2-connected graphs that have reliability factorisations (Q730493)
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: An infinite family of 2-connected graphs that have reliability factorisations |
scientific article; zbMATH DE number 6668742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infinite family of 2-connected graphs that have reliability factorisations |
scientific article; zbMATH DE number 6668742 |
Statements
An infinite family of 2-connected graphs that have reliability factorisations (English)
0 references
28 December 2016
0 references
network reliability
0 references
reliability polynomial
0 references
chromatic polynomial
0 references
Tutte polynomial
0 references
0.87951446
0 references
0 references
0 references
0.8663626
0 references
0.86505044
0 references
0 references
0.8629843
0 references
0.86226785
0 references
