On a measure of communication network vulnerability
- 1 December 1982
- Vol. 12 (4) , 405-409
- https://doi.org/10.1002/net.3230120405
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A counterexample to a conjecture on paths of bounded lengthJournal of Graph Theory, 1982
- Graphs as models of communication network vulnerability: Connectivity and persistenceNetworks, 1981
- Mengerian theorems for paths of bounded lengthPeriodica Mathematica Hungarica, 1978
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969