Existence of optimally‐greatest digraphs for strongly connected node reliability (Q6139368): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.22150 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.22150 / rank | |||
Normal rank | |||
Latest revision as of 18:48, 30 December 2024
scientific article; zbMATH DE number 7780320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Existence of optimally‐greatest digraphs for strongly connected node reliability |
scientific article; zbMATH DE number 7780320 |
Statements
Existence of optimally‐greatest digraphs for strongly connected node reliability (English)
0 references
18 December 2023
0 references
circulants
0 references
digraphs
0 references
network reliability
0 references
optimality
0 references
polynomials
0 references
strongly connected
0 references
0 references
