References
- 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.
- P. Dankelmann, The diameter of directed graphs, J. Combin. Theory Ser. B, 94 (2005), No. 1, 183-186. https://doi.org/10.1016/j.jctb.2004.11.005
- 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. https://doi.org/10.1016/0012-365X(89)90155-6
- B. Grunbaum and T. Motzkin, Longest simple paths in polyhedral graphs, J. Lond. Math. Soc.(2) 37, 152-160 (1962).
- 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.)
- V. Klee, Diameters of Polyhedral graphs, Canad. J. Math. 16 (1964), 602- 614. https://doi.org/10.4153/CJM-1964-061-2
- V. Klee, Classication and enumeration of minimum (d; 3; 3)-graphs for odd d, J. Combin. Theory Ser. B, 28 (1980), 184-207. https://doi.org/10.1016/0095-8956(80)90065-9
- V. Klee and H. Quaife, Minimum graphs of specied diameter, connectivity and valence, Math. Oper. Res. 1 (1976), No. 1, 28-31. https://doi.org/10.1287/moor.1.1.28
- 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. https://doi.org/10.1016/0095-8956(77)90059-4
- J. Moon, On the diameter of graph, Michigan Math. J. 12 (1965), 349-351. https://doi.org/10.1307/mmj/1028999370
- B. Myers, The minimum-order three-connected cubic graphs with specied diameters, IEEE Trans. Circuits Syst. CAS-27 (1980), No. 8, 698-709.
Cited by
- Minimum orders of eulerian oriented digraphs with given diameter vol.30, pp.7, 2014, https://doi.org/10.1007/s10114-014-3194-4