The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860)
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 7775505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.747549831867218
0 references
0.7395062446594238
0 references
0.7197971940040588
0 references
0.7193412780761719
0 references
