The Minimum Order of n-Connected n-Regular Graphs with Specified Diameters

IEEE Transactions on Circuits and Systems

Volumn 32, Issue 4, 1985, Pages 407-409

  Bhattacharya, Debashis ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORKS - ANALYSIS;

MINIMUM ORDER; N-CONNECTED N-REGULAR GRAPHS;

MATHEMATICAL TECHNIQUES;

EID: 0022043259     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1985.1085709     Document Type: Article

References (4)

1. B. R. Myers, “The minimum-order three-connected cubic graphs with specified diameters,” IEEE Trans. Circuits Syst., vol. CAS-27, pp 698-709, Aug. 1980.
2. F. Harary, Graph Theory, Reading MA: Addison-Wesley, 1972.
3. B. R. Myers, “The Klee and Quaife minimum (d, 1, 3)-graphs revisited,” IEEE Trans. Circuits Syst., vol. CAS-27, pp. 214-220, Mar. 1980.
4. V. Klee and H. Quaif, “Classification and enumeration of minimum (d, 1, 3)-graphs and (d, 2, 3)-graphs,” J. Combinatorial Theory, Series B, vol. 23, pp. 83-93, 1977.