DocumentCode :
1164219
Title :
On the Smallest Disconnecting Set in a Graph
Author :
Boesch, F.
Volume :
15
Issue :
3
fYear :
1968
fDate :
9/1/1968 12:00:00 AM
Firstpage :
286
Lastpage :
288
Keywords :
Communication network vulnerability; Cut sets; Directed graphs; Graph theory; Buildings; Communication systems; Design methodology; Graph theory; Iterative methods; Laboratories; TV; Telephony;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1968.1082832
Filename :
1082832
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1164219
