On uniformly most reliable complete multi-partite graphs (Q2918372)
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: On uniformly most reliable complete multi-partite graphs |
scientific article; zbMATH DE number 6091969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On uniformly most reliable complete multi-partite graphs |
scientific article; zbMATH DE number 6091969 |
Statements
5 October 2012
0 references
network reliability
0 references
vertex failure
0 references
complete multi-partite graph
0 references
uniformly most reliable graph
0 references
On uniformly most reliable complete multi-partite graphs (English)
0 references
0.9157970547676086
0 references
0.8641353249549866
0 references
0.8640697598457336
0 references
0.8620088696479797
0 references
