The <scp>Gross–Saccoman</scp> conjecture is true (Q6087152)
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: The <scp>Gross–Saccoman</scp> conjecture is true |
scientific article; zbMATH DE number 7775325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The <scp>Gross–Saccoman</scp> conjecture is true |
scientific article; zbMATH DE number 7775325 |
Statements
The <scp>Gross–Saccoman</scp> conjecture is true (English)
0 references
11 December 2023
0 references
graph theory
0 references
Gross-Saccoman conjecture
0 references
multigraphs
0 references
network reliability
0 references
optimization
0 references
uniformly optimally reliable graph
0 references
0.8813437819480896
0 references
0.8673544526100159
0 references
0.8598277568817139
0 references
0.8441296219825745
0 references
0.8057900667190552
0 references
