The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:52, 10 July 2024
scientific article; zbMATH DE number 7775505
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The node cop‐win reliability of unicyclic and bicyclic graphs |
scientific article; zbMATH DE number 7775505 |
Statements
The node cop‐win reliability of unicyclic and bicyclic graphs (English)
0 references
11 December 2023
0 references
bicyclic graph
0 references
cop-win graph
0 references
graph polynomial
0 references
network reliability
0 references
node cop-win reliability
0 references
node reliability
0 references
unicyclic graph
0 references
uniformly most reliable
0 references
