DocumentCode :
1184294
Title :
The minimum-order three-connected cubic graphs with specified diameters
Author :
Myers, Basil R.
Volume :
27
Issue :
8
fYear :
1980
fDate :
8/1/1980 12:00:00 AM
Firstpage :
698
Lastpage :
709
Abstract :
A minimum 
-graph is one which is regular of degree 
, has diameter 
and connectivity 
, and is of minimum order, i.e., has the minimum number of points. Such graphs have application in the design of survivable communications networks. The minimum order of a 
-graph is determined, and the construction of all minimum -graphs is described.
-graph is one which is regular of degree , has diameter and connectivity , and is of minimum order, i.e., has the minimum number of points. Such graphs have application in the design of survivable communications networks. The minimum order of a -graph is determined, and the construction of all minimum -graphs is described.Keywords :
Communication networks; Graph theory; Bipartite graph; Communication channels; Communication networks; Communication switching; Helium; Terminology; Writing;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1980.1084880
Filename :
1084880
Link To Document :
