DocumentCode :
1179170
Title :
An extension of Boesch-Thomas optimality in communication nets
Author :
Myers, B.
Volume :
24
Issue :
8
fYear :
1977
fDate :
8/1/1977 12:00:00 AM
Firstpage :
464
Lastpage :
465
Abstract :
A 
-disjoint simultaneous-flow communications net is one whose graph has nonintersecting paths joining (at most) any pairs of its vertices, and is said to be optimal if it also has the least possible number of edges. Such a graph is optimally invulnerable to disconnection in a sense defined previously by Boesch and Thomas, in that its connectivity is equal to the average of the degrees of its vertices. Not all communication nets that are optimal in the Boesch-Thomas sense, however, are optimal in the -disjoint simultaneous-flow sense.
-disjoint simultaneous-flow communications net is one whose graph has nonintersecting paths joining (at most) any pairs of its vertices, and is said to be optimal if it also has the least possible number of edges. Such a graph is optimally invulnerable to disconnection in a sense defined previously by Boesch and Thomas, in that its connectivity is equal to the average of the degrees of its vertices. Not all communication nets that are optimal in the Boesch-Thomas sense, however, are optimal in the -disjoint simultaneous-flow sense.Keywords :
Communication networks; Bipartite graph; Circuit testing; Equations; Mathematical model; Planarization; Terminology;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1977.1084362
Filename :
1084362
Link To Document :
