Graphs with the smallest number of minimum cut sets
- 1 March 1984
- Vol. 14 (1) , 47-61
- https://doi.org/10.1002/net.3230140105
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the design of reliable networksNetworks, 1973
- On the Invulnerability of the Regular Complete k-Partite GraphsSIAM Journal on Applied Mathematics, 1971
- THE MAXIMUM CONNECTIVITY OF A GRAPHProceedings of the National Academy of Sciences, 1962