1 |
D. Bhattacharya, The minimum order of n-connected n-regular graphs with specied diameters, IEEE Trans. Circuits Syst., CAS-32 (1985), No. 4, 407- 409.
|
2 |
P. Dankelmann, The diameter of directed graphs, J. Combin. Theory Ser. B, 94 (2005), No. 1, 183-186.
DOI
ScienceOn
|
3 |
E. Engelhardt, V. Klee, K. Li, H. Quaife,Minimum graphs of specied diam- eter, connectivity and valence. II., Discrete Math. 78 (1989), No. 3, 257-266.
DOI
ScienceOn
|
4 |
B. Grunbaum and T. Motzkin, Longest simple paths in polyhedral graphs, J. Lond. Math. Soc.(2) 37, 152-160 (1962).
|
5 |
A. Knyazev, Diameters of Pseudosymmetric Graphs (Russian), Mat. Zametki, 41 (1987), No. 6, 829-843. (English translation: Math. Notes, 41 (5-6) (1987), 473-482.)
|
6 |
V. Klee, Diameters of Polyhedral graphs, Canad. J. Math. 16 (1964), 602- 614.
DOI
|
7 |
V. Klee, Classication and enumeration of minimum (d; 3; 3)-graphs for odd d, J. Combin. Theory Ser. B, 28 (1980), 184-207.
DOI
|
8 |
V. Klee and H. Quaife, Minimum graphs of specied diameter, connectivity and valence, Math. Oper. Res. 1 (1976), No. 1, 28-31.
DOI
ScienceOn
|
9 |
V. Klee and H. Quaife, Classication and enumeration of minimum (d; 1; 3)- graphs and minimum (d; 2; 3)-graphs, J. Combin. Theory Ser. B, 23 (1977), 83-93.
DOI
|
10 |
J. Moon, On the diameter of graph, Michigan Math. J. 12 (1965), 349-351.
DOI
|
11 |
B. Myers, The minimum-order three-connected cubic graphs with specied diameters, IEEE Trans. Circuits Syst. CAS-27 (1980), No. 8, 698-709.
|