A recursive formula for the two‐edge connected and biconnected reliability of a complete graph (Q4638582)
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: A recursive formula for the two‐edge connected and biconnected reliability of a complete graph |
scientific article; zbMATH DE number 6865266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A recursive formula for the two‐edge connected and biconnected reliability of a complete graph |
scientific article; zbMATH DE number 6865266 |
Statements
A recursive formula for the two‐edge connected and biconnected reliability of a complete graph (English)
0 references
27 April 2018
0 references
network reliability
0 references
biconnected graph
0 references
two-edge connected graph
0 references
integer partition
0 references
random graph
0 references
connectivity
0 references
