Classes of uniformly most reliable graphs for all-terminal reliability (Q2322865)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7101876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classes of uniformly most reliable graphs for all-terminal reliability |
scientific article; zbMATH DE number 7101876 |
Statements
Classes of uniformly most reliable graphs for all-terminal reliability (English)
0 references
5 September 2019
0 references
all-terminal reliability
0 references
reliability polynomial
0 references
network reliability
0 references
spanning subgraphs
0 references
0.93729085
0 references
0 references
0.9200955
0 references
0.9165423
0 references
0.9118425
0 references
0.9098908
0 references
0.9044416
0 references
0.90426826
0 references
0.9039198
0 references
