An Algorithm for Construction of the Least Vulnerable Communication Network or the Graph with the Maximum Connectivity
- 1 May 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 16 (2) , 229-230
- https://doi.org/10.1109/tct.1969.1082940
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the Smallest Disconnecting Set in a GraphIEEE Transactions on Circuit Theory, 1968
- THE MAXIMUM CONNECTIVITY OF A GRAPHProceedings of the National Academy of Sciences, 1962