<scp>M</scp>ost reliable two‐terminal graphs with node failures (Q6092632)
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 7769693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | <scp>M</scp>ost reliable two‐terminal graphs with node failures |
scientific article; zbMATH DE number 7769693 |
Statements
<scp>M</scp>ost reliable two‐terminal graphs with node failures (English)
0 references
23 November 2023
0 references
graph polynomial
0 references
node reliability
0 references
reliability polynomial
0 references
two-terminal graph
0 references
two-terminal reliability
0 references
uniformly most reliable
0 references
0.9322044849395752
0 references
0.9109894633293152
0 references
0.9005014300346375
0 references
0.873724102973938
0 references
