Graphs with the smallest number of minimum cut sets (Q3344017)
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: Graphs with the smallest number of minimum cut sets |
scientific article; zbMATH DE number 3878963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with the smallest number of minimum cut sets |
scientific article; zbMATH DE number 3878963 |
Statements
Graphs with the smallest number of minimum cut sets (English)
0 references
1984
0 references
vertex cut sets
0 references
regular graph
0 references
network reliability
0 references
0.8344913125038147
0 references
0.8321559429168701
0 references
0.7924938201904297
0 references
0.7891231775283813
0 references
0.783100962638855
0 references
