On uniformly most reliable two‐terminal graphs (Q4686674): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.21811 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2791423714 / rank | |||
Normal rank | |||
Latest revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 6947039
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On uniformly most reliable two‐terminal graphs |
scientific article; zbMATH DE number 6947039 |
Statements
On uniformly most reliable two‐terminal graphs (English)
0 references
4 October 2018
0 references
graph polynomial
0 references
optimal network
0 references
reliability polynomial
0 references
two-terminal reliability
0 references
two-terminal graph
0 references
uniformly most reliable
0 references
