Moore graphs and beyond: A survey of the degree/diameter problem

Electronic Journal of Combinatorics

Volumn , Issue , 2009, Pages 1-61

  Miller, Mirka ^a   Širáň, Jozef ^b  

^a UNIVERSITY OF BALLARAT   (Australia)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957570789     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (243)

1. M. Aider, Ŕeseaux d'interconnexion bipartis orient ́es, Rev. Maghr ́ebine Math. 1 (1992) No. 1, 79-92.
2. N. Alon, S. Hoory and N. Linial, The Moore bound for irregular graphs, Graphs and Combinatorics 18 (2002) 53-57.
3. F. Aguiló-Gost, New dense families of triple loop networks. Discrete Math. 197-198 (1999) 15-27.
4. F. Aguiló, M.A. Fiol and C. Garcia, Triple loop networks with small transmission delay, Discrete Mathematics 167/168 (1997) 3-16.
5. S.B. Akers, On the construction of (d, k) graphs, IEEE Trans. Electronic Computers (Short Notes) EC-14 (1965) 448.
6. S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric intercon- nection networks, IEEE Transactions on Computers 38 (1989) 555-566.
7. I Alegre, personal communication to M. Miller via K. Culik II and I. Fris.
8. I. Alegre, M.A. Fiol and J.L.A. Yebra, Some large graphs with given degree and diameter, J. Graph Theory 10 (1986) 219-224.
9. J. Allwright, New (Δ, D)-graphs discovered by heuristic search, Discrete Applied Mathematics 37/38 (1992) 3-8.
10. F. Annexstein, M. Baumslag, A. L. Rosenberg, Group action graphs and parallel architectures, SIAM J. Comput. 19 (1990) 544-569.
11. B. W. Arden and H. Lee, Analysis of chordal ring network, IEEE Trans. Comput. 30 (1981) No. 4, 291-295.
12. L. Babai, P. Erdos, Representation of group elements as short products, "Theory and practice of combinatorics", North Holland Math. Stud. 60, North Holland, Amsterdam, 1982, 27-30.
13. L. Babai, G. L. Hetyei, On the diameter of random Cayley graphs of the symmetric group, Combin. Probab. Comput. 1 (1992) No. 3, 201-208.
14. L. Babai, W. M. Kantor, A. Lubotzky, Small-diameter Cayley graphs for finite simple groups, European J. Combin. 10 (1989) No. 6, 507-522.
15. L. Babai, A. Seress, On the diameter of Cayley graphs of the symmetric group, J, Combinat. Theory Ser A 49 (1988) No. 1, 175-179.
16. L. Babai, A. Seress, On the diameter of permutation groups, European J. Combinat. 13 (1992) No. 4, 231-243.
17. M.C. Balbuena, A. Carmona, J. Fáabrega and M.A. Fiol, On the order and size of s-geodetic digraphs with given connectivity, Discrete Mathematics 174 (1997) 19-27.
18. M.C. Balbuena, J. Fàlbrega, X. Marcote, I. Pelayo, Superconnected digraphs and graphs with small conditional diameters, Networks 39 (2002) No. 3, 153-160.
19. E. Bannai and T. Ito, On finite Moore graphs, J. Fac. Sci. Tokyo Univ. 20 (1973) 191-208.
20. E. Bannai and T. Ito, Regular graphs with excess one, Discrete Mathematics 37 (1981) 147-158.
21. D. Barth and M.-C. Heydemann, A new digraph composition with applications to de Bruijn and generalised de Bruijn digraphs, Discrete Applied Mathematics 77 (1997) 99-118.
22. R. Bar-Yehuda and T. Etzion, Connections between two cycles - a new design of dense processor interconnection networks, Discrete Applied Mathematics 37/38 (1992) 29-43.
23. E.T. Baskoro, Optimal Directed Networks, Master Thesis, UNE, Armidale, Australia (1991).
24. E.T. Baskoro and Amrullah, Almost Moore digraphs of degree 4 without selfrepeats, Journal of the Indonesian Mathematical Society (MIHMI), 8 (2002) No. 1, 51-60.
25. E.T.Baskoro, L. Branković, M. Miller, J. Plesník, J. Ryan and J. Širáň, Large digraphs with small diameter: A voltage assignment approach, Journal of Combi- natorial Mathematics and Combinatorial Computing 24 (1997) 161-176.
26. E.T. Baskoro, Y.M. Cholily and M. Miller, Structure of repeat cycles in almost Moore digraph with selfrepeats and diameter 3, preprint.
27. E.T. Baskoro, Y.M. Cholily and M. Miller, Structure of repeat cycles in almost Moore digraphs, preprint.
28. E.T. Baskoro and M. Miller, On the construction of networks with minimum diam- eter, Australian Computer Science Communications C 15 (1993) 739-743.
29. E.T. Baskoro and M. Miller, A procedure for constructing a minimum-diameter digraph, Bulletin of ICA 17 (1996) 8-14.
30. E.T. Baskoro, M. Miller, J. Plesník and Š. Zńm, Regular digraphs of diameter 2 and maximum order, the Australasian Journal of Combinatorics 9 (1994) 291-306. See also Errata, 13 (1995).
31. E.T. Baskoro, M. Miller, J. Plesník and Š. Znám, Digraphs of degree 3 and order close to Moore bound, J. Graph Theory 20 (1995) 339-349.
32. E.T. Baskoro, M. Miller and J. Plesník, On the structure of digraphs with order close to the Moore bound, Graphs and Combinatorics 14 (1998) No.2, 109-119.
33. E.T. Baskoro, M. Miller and J. Plesník, Further results on almost Moore digraphs, Ars Combinatoria 56 (2000) 43-63.
34. E.T. Baskoro, M. Miller, J. Širáň and M. Sutton, A complete characterisation of almost Moore digraphs of degree three, J. Graph Theory, to appear.
35. E.T. Baskoro, M. Miller and J. Širáň A remark on almost Moore digraphs of degree three, Acta Math. Univ. Comenianae LXVI (1997) No.2, 285-291.
36. D. Bauer, F.T. Boesch, C. Suffel and R.Van Slyke, On the validity of a reduction of reliable networks design to a graph extremal problem, IEEE Trans. on Circuits and Systems CAS-34 (1987) 1579-1581.
37. C.T. Benson, Minimal regular graphs of girth eight and twelve, Canad. J. Math 18 (1966) 1091-1094.
38. C.T. Benson and N.E. Losey, On a graph of Hoffman and Singleton, J. Combinato- rial Theory Ser. B 11 (1971) 67-79.
39. J.-C. Bermond and B. Bollobás, The diameter of graphs: A survey, Congressus Numerantium 32 (1981) 3-27.
40. J.-C. Bermond, F. Comellas, D.F. Hsu, Distributed loop computer networks: a survey J. Parallel and Distributed Computing 24 (1995) 2-10.
41. J.-C. Bermond, C. Delorme and G. Farhi, Large graphs with given degree and diameter III, Annuals of Discrete Mathematics 13 (1982) 23-32.
42. J.-C. Bermond, C. Delorme and G. Farhi, Large graphs with given degree and diameter II, Journal of Combinatorial Theory (B) 36 (1984) 32-48.
43. J.-C. Bermond, C. Delorme and J.-J. Quisquater, Grands graphes non dirigés de degré et diam̀etre fixés, Ann. Discrete Math. 17 (1982) 65-73.
44. J.-C. Bermond, C. Delorme and J.-J. Quisquater, Tables of large graphs with given degree and diameter, Information Processing Letters 15 (1982) 10-13.
45. J.-C. Bermond, C. Delorme and J.-J. Quisquater, Grands graphes de degré et di- ametre fixés, Combinatorial Mathematics (Marseille-Luminy, 1981) 65-73; North- Holland Math. Stud. 75 North-Holland, Amsterdam-New York (1983).
46. J.-C. Bermond, C. Delorme and J.-J. Quisquater, Tables of large (Δ, D)-graphs, Discrete Applied Mathematics 37/38 (1992) 575-577.
47. J.-C. Bermond, C. Delorme and J.-J. Quisquater, Strategies for interconnection networks: some methods from graph theory, Journal of Parallel and Distributed Computing 3 (1986) 433-449.
48. J.-C. Bermond, F.O. Ergincan, Bus interconnection networks, Discrete Appl. Math. 68 (1996) 1-15.
49. J.-C. Bermond, P. Hell, On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs, J. Graph Theory 17 (1993) 647-655.
50. J.-C. Bermond, P. Hell, J.-J. Quisquater, Construction of large packet radio net- works, Parallel Processing Letters 2 (1992) 3-12.
51. J.-C. Bermond, N. Homobono and C. Peyrat, Large fault-tolerant interconnection networks, Graphs and Combinatorics 5 (1989) 107-123.
52. J.-C. Bermond, N. Homobono and C. Peyrat, Connectivity of Kautz networks, Discrete Mathematics 114 (1993) No. 1-3, 51-62.
53. J.-C. Bermond, C. Peyrat, De Bruijn and Kautz networks, a competitior for the hy-percube? Proc. 1st European Workshop on Hypercubes and Distributed Computers, Rennes (1989) 279-293.
54. N.I. Biggs, Algebraic Graph Theory, Cambridge University Press, Second Edition, Great Britain (1993).
55. N.I. Biggs, Girth, valency and excess, Linear Algebra Appl. 31 (1980) 55-59.
56. N.I. Biggs and T. Ito, Graphs with even girth and small excess, Math. Proc. Cam-bridge Phil. Soc. 88 (1980) No. 1, 1-10.
57. B. Bollobás Extremal Graph Theory, Academic Press, New York (1978).
58. J. Bond and C. Delorme, New large bipartite graphs with given degree and diameter, Ars Combinatoria 25C (1988) 123-132.
59. J. Bond and C. Delorme, A note on partial Cayley graphs, Discrete Mathematics 14 (1993) No.1-3, 63-74.
60. J. Bosák Cubic Moore graphs, Mat. C ̌asopis Slovenskej Akadémie Vied 20 (1970) 72-80.
61. J. Bosák Directed graphs and matrix equations, Math. Slovaca 28 (1978) No. 2, 189-202.
62. J. Bosák Partially directed Moore graphs, Math. Slovaca 29 (1979) No. 2, 181-196.
63. J. Bosák, A. Kotzig and Š. Znám, Strongly geodetic graphs, Journal of Combina-torial Theory 5 (1968) 170-176.
64. R.C. Bose and T.A. Dowling, A generalization of Moore graphs of diameter two, J. Comb. Th. 11 (1971) 213-226.
65. L. Branković, M. Miller, J. Plesník, J. Ryan, J. Šira ́ň, Large graphs with small degree and diameter: A voltage assignment approach, Australas. J. Combin. 18 (1998) 65-76.
66. L. Branković M. Miller, J. Plesník, J. Ryan, J. Šira ́ň, A note on constructing large Cayley graphs of given degree and diameter by voltage assignments, Electronic J. Combin. 5 (1998) No. 1, article R9.
67. W.G. Bridges and S. Toueg, On the impossibility of directed Moore graphs, J. Combinatorial Theory B 29 (1980) 339-341.
68. W.G. Brown, On graphs that do not contain a Thompsen graph, Canad. Math. Bull. 9 (1966) 281-285.
69. N.G. de Bruijn, A combinatorial problem, Koninkl. Nederl. Acad. Wetensch. Proc. Ser A 49 (1946) 758-764.
70. R.W. Buskens and R.G. Stanton, Generalized Moore graphs on twelve and thirteen vertices, Ars Combinat. 23B (1987) 87-132.
71. R.W. Buskens, M.J. Rogers and R.G. Stanton, A census of tetravalent generalized Moore networks, Congressus Numerantium 52 (1986) 255-296.
72. P.J. Cameron, Automorphism groups of graphs, in: Selected Topics in Graph Theory 2 (1983) Acad. Press.
73. L. Campbell, Dense group networks, Discrete Applied Mathematics 37/38 (1992) 65-71.
74. L. Campbell, G.E. Carlsson, M.J. Dinneen, V. Faber,
75. E.A. Canale and J. Gómez, Asymptotically large (Δ, D)-graphs, Discrete AppliedMath., to appear.
76. E.A. Canale and J. Gómez, Superfluous edges and exponential expansions of de- Bruijn and Kautz digraphs, Discrete Applied Math. 138 (2004), 303-331.
77. M.R. Fellows, M.A. Langston, J.W. Moore, A.P. Mullhaupt and H.B. Sexton, Small diameter symmetric networks from linear groups, IEEE Transactions on Computers 41 (1992) No. 2, 218-220.
78. G.E. Carlsson, J. Cruthirds, H. Sexton and C. Wright, Interconnection networks based on generalization of cube-connected cycles, IEEE Trans. Comput. C-34 (1985) No. 8, 769-772.
79. V.G. Cerf, D.D. Cowan, R.C. Mullin and R.G. Stanton, Computer networks and generalized Moore graphs, Congr. Num. 9 (1973) 379-398.
80. V.G. Cerf, D.D. Cowan, R.C. Mullin and R.G. Stanton, Trivalent generalized Moore networks on sixteen nodes, Utilitas Math. 6 (1974) 259-283.
81. Y.M. Cholily, E.T. Baskoro and S. Uttunggadewa, Some conditions for the existence of (d, k)-digraphs containing selfrepeat, preprint.
82. D.V. Chudnovsky, G.V. Chudnovsky and M.M. Denneau, Regular graphs with small diameter as models for interconnection networks, Proc. 3rd Internat. Conf. on Su- percomputing ICS'88, Boston (1988) 232-239.
83. F.R.K. Chung, Diameters of communication networks, in: AMS Short Course on the Mathematics of Information Processing 34, Amer. Math. Soc., Providence, RI (1986) 1-18.
84. F.R.K. Chung, Diameters of graphs: old problems and new results, Congr. Numer. 60 (1987) 295-317.
85. F.R.K. Chung, Diameters and eigenvalues, Journal of American Mathematical So- ciety 2 (1989) No. 2, 187-196.
86. F.R.K. Chung, C. Delorme and P. Soĺe, Multidiameters and multiplicities, European J. Combin. 20 (1999) 629-640.
87. Chung, F.R.K.; Faber, V.; Manteuffel, Thomas A. An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. SIAM J. Discrete Math. 7 (1994) No.3, 443-457.
88. F. Comellas, The degree/diameter problem for graphs, http://www-mat.upc.es/grup.de.grafs/table.g.html.
89. F. Comellas, http://maite71.upc.es/grupdegrafs/grafs/tauladeltad.htm.
90. F. Comellas and M.A. Fiol, Using simulated annealing to design interconnection networks, Technical Report DMAT-05-0290, Universitat Politécnica de Catalunya (1990).
91. F. Comellas and M.A. Fiol, Vertex symmetric digraphs with small diameter, Dis- crete Applied Mathematics 58 (1995) 1-12.
92. F. Comellas, M.A. Fiol and J. Gómez, On large vertex symmetric 2-reachable di- graphs, Parallel Processing Letters 4 (1994) 379-384.
93. F. Comellas and J. Gómez, New large graphs with given degree and diameter, Graph Theory, Combinatorics and Algorithms 1,2: Proc. 7th Quadrennial Int'l Conf. on the theory and Appl. of Graphs, Kalamazoo (MI, USA) (1992), edited by Y. Alavi and A. Schwenk, (1995) 221-233.
94. F. Comellas, P. Morillo and M.A. Fiol, Diameter and mean distance of bipartite digraphs related to plane tessellations, Ars Combin. 29 B (1990) 245-254.
95. R.M. Damerell, On Moore graphs, Proc. Cambridge Phil. Soc. 74 (1973) 227-236.
96. R.M. Damerell, On Moore geometries II, Math. Proc. Camb. Phil. Soc. 90 (1981) 33-40.
97. R.M. Damerell and M.A. Georgiacodis, On Moore geometries I, J. London Math. Soc. 23 (1981) No. 2, 1-9.
98. C. Delorme, Grands graphes de degré et diam̀etre donnés, European J. Combin. 6(1985) 291-302.
99. C. Delorme, Large bipartite graphs with given degree and diameter, J. Graph Theory 8 (1985) 325-334.
100. C. Delorme, Examples of products giving large graphs with given degree and diam- eter, Discrete Applied Mathematics 37/38 (1992) 157-167.
101. C. Delorme and G. Farhi, Large graphs with given degree and diameter-part I, IEEE Transactions on Computers C-33 (1984) 857-860.
102. C. Delorme and J. Gómez, Some new large compound graphs, Europ. J. of Combin. 23 (2002) No. 5, 539-547.
103. C. Delorme and J.J. Quisquater, Some new large compound graphs, Internal Report 317, LRI, December 1986.
104. M.J. Dinneen, Algebraic methods for efficient network constructions, Master's The- sis, Department of Computer Science, University of Victoria, Canada (1991).
105. M.J. Dinneen and P.R. Hafner, New results for the degree/diameter problem, Net- works 24 (1994) 359-367.
106. K.W. Doty, New designs for dense processor interconnection networks, IEEE on Transactions on Computers C-33 (1984) No. 5, 447-450.
107. R. Dougherty and V. Faber, The degree-diameter problem for several varieties of Cayley graphs, I: The Abelian case, preprint (2001).
108. R.D. Dutton and R.C. Brigham, Edges in graphs with large girth, Graphs and Combinatorics 7 (1991) 315-321.
109. B. Elspas, Topological constraints on interconnection-limited logic, Proc. IEEE Fifth Symposium on Switching Circuit Theory and Logical Design, IEEE S-164 (1964) 133-147.
110. M. Espona and O. Serra, Cayley digraphs based on the networks, SIAM J. Discrete Math. 11 (1998) No. 2, 305-317.
111. P. Erdos, S. Fajtlowicz and A.J. Hoffman, Maximum degree in graphs of diameter 2, Networks 10 (1980) 87-90.
112. G. Exoo, A family of graphs and the degree/diameter problem, J. Graph Theory 37 (2001) No. 2, 118-124.
113. G. Exoo, Voltage graphs, group presentations and cages, Electron. J. Combinat. 11 (2004) Note 2, 7 pp.
114. V. Faber and J.W. Moore, High-degree low-diameter interconnection networks with vertex symmetry: the directed case. Technical Report LA-UR-88-1051, Los Alamos National Laboratory, Los Alamos, New Mexico (1988).
115. V. Faber, J.W. Moore and W.Y.C Chen, Cycle prefix digraphs for symmetric inter- connection networks, Networks 23 (1993) 641-649.
116. J. Fàbrega and M.A. Fiol, Maximally connected digraphs, Journal of Graph Theory 13 (1989) 657-668.
117. S. Fajtlowicz, Graphs of diameter 2 with cyclic defect, Colloquium Mathematicum 51 (1987) 103-106.
118. M. Fellows, P. Hell and K. Seyffarth, Large planar graphs with given diameter and maximum degree, Discrete Appl. Mathematics 61 (1995) 133-153.
119. M. Fellows, P. Hell and K. Seyffarth, Constructions of large planar networks with given degree and diameter, Networks 32 (1998) 275-281.
120. M.A. Fiol, Connectivity and superconnectivity of large graphs and digraphs, Twelfth British Combinatorial Conference (Norwich, 1989), Ars Combinatoria 29B (1990) 5-16.
121. M.A. Fiol, The connectivity of large digraphs and graphs, J. Graph Theory 17 (1993) 31-45.
122. M.A. Fiol, I. Alegre and J.L.A. Yebra, Line digraph iterations and the (d, k) problem for directed Graphs, IEEE Transactions on Computers C-33 (1984) 400-403.
123. M.A. Fiol, J. Fàbrega and M. Escudero, Short paths and connectivity in graphs and digraphs, Ars Combinatoria 29B (1990) 17-31.
124. M.A. Fiol and J. Fàbrega, Some compound graphs, Stochastica 7 No.2 (1983) 137-143.
125. M.A. Fiol and J. Gimbert, On almost Moore bipartite digraphs with odd diameter, Congr. Numer. 152 (2001), 169-187.
126. M.A. Fiol, J. Gimbert, J. Gómez and Y. Wu, On Moore bipartite digraphs, J. Graph Theory 43 (2003) No. 3, 171-181.
127. M.A. Fiol, J. Gimbert and M. Miller, Multipartite Moore digraphs, preprint.
128. M.A. Fiol, A.S. Lladó and J.L. Villar, Digraphs on alphabets and the (d, N) digraph problem, Ars Combinatoria 25C (1988) 105-122.
129. M.A. Fiol and A.S. Lladó, The partial line digraph technique in the design of large interconnection networks, IEEE Transactions on Computers 41 (1992) 848-857.
130. M.A. Fiol and J.L.A. Yebra, Dense bipartite digraphs, J. Graph Theory 14 (1990) 687-700.
131. M. A. Fiol, J. L. A. Yebra, J. Fabrega, Sequence graphs and interconnection net- works, Ars Combinatoria 16A (1983) 7-13.
132. M. Fried and J.H. Smith, Primitive groups, Moore graphs, and rational curves, Michigan Math. J. 19 (1972) 341-346.
133. H. Friedman, A design for (d, k) Graphs, IEEE Trans. Electronic Computers EC-15 (1996) 253-254.
134. H. Friedman, On the impossibility of certain Moore graphs, J. Combinatorial Theory Ser. B 10 (1971) 245-252.
135. F.J. Fuglister, On finite Moore geometries, J. Comb. Th. A 23 (1977) 187-197.
136. F.J. Fuglister, The nonexistence of Moore geometries of diameter 4, Discrete Math-ematics 45 (1983) 229-238.
137. C. Garcia and C. Peyrat, Large Cayley graphs on an abelian group, Discrete Appl. Mathematics 75 (1997) No. 2, 125-133.
138. J. Gimbert, On the existence of (d, k)-digraphs, 16th British Combinatorial Confer- ence (London, 1997), Discrete Mathematics 197/198 (1999) 375-391.
139. J. Gimbert, On digraphs with unique walks of closed lengths between vertices, Australasian Journal of Combinatorics 20 (1999) 77-90.
140. J. Gimbert, Enumeration of almost Moore digraphs of diameter two, Discrete Math. 231 (2001) 177-190.
141. J. Gómez, Generalized compound graphs, Ars Combinatoria 29B (1990) 33-53.
142. J. Gómez, On large (Δ, 6)-graphs Networks, to appear.
143. J. Gómez, E.A. Canale and X. Munoz, On the unilateral (Δ, D*)-problem, Networks 34 (2000), 164-171.
144. J. Gómez, E.A. Canale and X. Munoz, Unilaterally connected large digraphs and generalized cycles, Networks 42 (2000), 181-188.
145. J. Gómez, M. Escudero, Optimal edge coloring of large graphs, Networks 34 (1999) 61-65.
146. J. Gómez, M. Fiol, Dense compound graphs, Ars Combinatoria 20A (1985) 211-237.
147. J. Gómez, M.A. Fiol and O. Serra, On large (Δ, D)-graphs, Discrete Mathematics 114 (1993) 219-235.
148. J. Gómez, M.A. Fiol and J.L.A. Yebra, Graphs on alphabets as models for large interconnection networks, Discrete Applied Mathematics 37/38 (1992) 227-243.
149. J. Gómez, and M. Miller, Two new families of compound graphs, preprint.
150. J. Gómez, P. Morillo and C. Padró Large (d, D, D0, s)-bipartite digraphs, Discrete Applied Mathematics 59 (1995) No. 2, 103-114.
151. J. Gómez, C. Padró and C. Perennes, Large generalized cycles, Discrete Applied Mathematics 89 (1998) 107-123.
152. J. Gómez, I. Pelayo and C. Balbuena, New large graphs with given degree and diameter six, Networks 34 (1999) No. 2, 154-161.
153. J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley, New York (1987).
154. W. H. Haemers, Eigenvalue technique in design and graph theory, Mathematical Centre Tracts 121, Matematisch Zentrum, Amsterdam (1980).
155. P. R. Hafner, Large Cayley graphs and digraphs with small degree and diameter, Computational Algebra and Number Theory (W. Bosma and van der Poorten, eds.) Kluwer, Amsterdam (1995) 291-302.
156. P. R. Hafner, On the graphs of McKay-Miller-Širáň, Proc. 8th Intl. Colloquium on Structural Information and Communication Complexity (SIROCCO 8), Proceedings in Informatics 11 (F. Comellas, J. Fabrega, P. Fraigniaud, eds.), Carleton Scientific (2001) 209-215.
157. P.R. Hafner, The Hoffman-Singleton graph and its automorphisms, J. Algebraic Combin., to appear.
158. P.R. Hafner, Geometric realisation of the automorphism group of the graphs of McKay-Miller-Širáň, preprint.
159. P. Hell and K. Seyffarth, Largest planar graphs of diameter two and fixed maximum degree, Discrete Mathematics 111 (1993) 313-332.
160. A.J. Hoffman and R.R. Singleton, On Moore graphs with diameter 2 and 3, IBM J. Res. Develop. 4 (1960) 497-504.
161. N. Homobono and C. Peyrat, Connectivity of Imase and Itoh digraphs, IEEE TRansactions on Computers 37 (1988) 1459-1461.
162. M. N. Huxley, On the difference between consecutive primes, Invent. Math. 15 (1972) 164-170.
163. M. Imase and M. Itoh, Design to minimize diameter on building-block network, IEEE Trans. on Computers C-30 (1981) 439-442.
164. M. Imase and M. Itoh, A design for directed graphs with minimum diameter, IEEE Trans. on Computers C-32 (1983) 782-784.
165. M. Imase, T. Soneoka and K. Okada, Connectivity of regular directed graphs with small diameter, IEEE Transactions on Computers C-34 (1985) 267-273.
166. H. Iswadi and E.T. Baskoro, On (4,2)-digraphs containing a cycle of length 2, Bull. Malaysian Math. Sci. Soc. (2) 23 (2000), No. 1, 79-91.
167. L.O. James, A combinatorial proof that the Moore (7,2) graph is unique, Utilitas Math. 5 (1974) 79-84.
168. L.K. Jorgensen, Diameters of cubic graphs, Discrete Appl. Mathematics 37/38 (1992) 347-351.
169. W. M. Kantor, Some large trivalent graphs having small diameters, Discrete Applied Math. 37/38 (1992), 353-357.
170. W.H. Kautz, Bounds on directed (d, k) graphs, Theory of cellular logic networks and machines, AFCRL-68-0668 Final Report (1968) 20-28.
171. W.H. Kautz, Design of optimal interconnection networks for multiprocessors, Ar- chitecture and Design of Digital Computers, NATO Advanced Summer Institute (1969) 249-272.
172. M. Knor, A note on radially Moore digraphs, IEEE Trans. Comput. 45 (1996) 381-383.
173. M. Knor and J. Širáň, Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface, Journal of Graph Theory 24 (1997) 1-8.
174. I. Korn, On (d, k) graphs, IEEE Trans. Electronic Computers EC-16 (1967) 90.
175. F. Kramer, Relations between the diameter of a graph and the degrees of the nodes of a graph (Romanian), Rev. Anal. Numer. Teoria Aproximaţiei 1 (1972) 125-131.
176. K. Kurosawa and S. Tsujii, Considerations on diameter of communication networks, Electronics and Communications in Japan 64A (1981) No. 4, 37-45.
177. S. Lakshmivarahan, J.S. Jwo and S.K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Computing 19 (1993) 361-407.
178. R. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979) No. 2, 177-189.
179. B.D. McKay, M. Miller and J. Širáň, A note on large graphs of diameter two and given maximum degree, J. Combin. Theory Ser. B 74 (1998) No. 1, 110-118.
180. G. Memmi, and Y. Raillard, Some new results about the (d, k) graph problem, IEEE Trans. on Computers C-31 (1982) 8.
181. M. Miller, Extremal Digraphs, M.A. Thesis, Department of Mathematics, Statistics and Computing Science, University of New England, Australia (1986).
182. M. Miller, Digraph covering and its application to two optimization problems for digraphs, Australasian Journal of Combinatorics 3 (1991) 151-164.
183. M. Miller, Some open problems in optimal digraphs, Tatra Mountains Mathematical Publications 9 (1996) 89-96.
184. M. Miller and I. Fris, Maximum order digraphs for diameter 2 or degree 2, Pullman volume of Graphs and Matrices, Lecture Notes in Pure and Applied Mathematics 139 (1992) 269-278.
185. M. Miller, J. Gimbert, J. Širáň, and Slamin, Almost Moore digraphs are diregular, Discrete Mathematics 218 (2000) 265-270.
186. M. Miller, M.H. Nguyen and R. Simanjuntak, Repeat structure in regular graphs and digraphs, Proceedings of the 2nd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB2003), Prague (2003) 265-270.
187. M. Miller and J. Širáň, Digraphs of degree two which miss the Moore bound by two, Discrete Mathematics 226 (2001) 269-274.
188. M. Miller and Slamin, On the monotonicity of minimum diameter with respect to order and maximum out-degree, Proceedings of COCOON 2000, Lecture Notes in Computer Science 1858 (D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin (eds.)) (2000) 192-201.
189. M. Miller and R. Simanjuntak, Graphs of order two less than the Moore bound, Discrete Mathematics, to appear.
190. P. Morillo, M.A. Fiol and J. F ábrega, The diameter of directed graphs associated to plane tessellations, Ars Combin. 20A (1985) 17-27.
191. P. Morillo, M.A. Fiol and J.L.A. Yebra, A new family of graphs associated with plane tessellations, Ars Combin. 20A (1985) 163-169.
192. X. Munoz and J. Gómez, Asymptotically optimal (Δ, D0, s)-digraphs, Ars Combin. 49 (1998) 97-111.
193. M.H. Nguyen and M. Miller, Structural properties of graphs of diameter 2 with maximal repeats, preprint.
194. M.H. Nguyen and M. Miller, Towards a characterization of graphs of diameter 2 and defect 2, preprint.
195. M.H. Nguyen and M. Miller, The nonexistence of certain graphs of diameter 2 and defect 2, preprint.
196. M.H. Nguyen and M. Miller, Moore bound for mixed networks, preprint.
197. M.H. Nguyen and M. Miller, A classification of graphs of diameter 2 and defect 3, preprint.
198. M.H. Nguyen, M. Miller and J. Gimbert, On mixed Moore graphs, Discrete Math- ematics, to appear.
199. J. Opatrný D.Sotteau, Linear congruential graphs, Graph theory, combinatorics, algorithms, and applications (San Francisco, CA, 1989), SIAM, Philadelphia (1991), 404-415.
200. J. Opatrný, D. Sotteau, N. Srinivasan, K. Thulasiraman, DCC linear congruential graphs: a new class of interconnection networks. IEEE Trans. Comput. 45 (1996) No. 2, 156-164.
201. S. Perennes, A proof of Jean de Rumeur's Conjecture Discrete Appl. Math. 74 (1997) 295-299.
202. J. Plesník, One method for proving the impossibility of certain Moore graphs, Dis- crete Mathematics 8 (1974) 363-376.
203. J. Plesník and Š Znám, Strongly geodetic directed graphs, Acta F. R. N. Univ. Comen. - Mathematica XXIX (1974) 29-34.
204. H. J. Quaife, On (d, k, μ) graphs, IEEE Trans. Computers C-18 (1969) 270-272. [205] J. J. Quisquater, Chordal rings, communicated February 27 1998.
205. J. J. Quisquater, Chordal rings, communicated February 27 1998.
206. C. Roos and A.J. van Zanten, On the existence of certain generalized Moore geome- tries, Part I, Discrete Mathematics 51 (1984) 179-190.
207. C. Roos and A.J. van Zanten, On the existence of certain generalized Moore geome- tries, Part II, Discrete Mathematics 51 (1984) 277-282.
208. G. Sabidussi, Graphs without dead ends, Europ. J. Combinatorics 17 (1996) 69-87.
209. M. Sampels and S. Schöf, Massively parallel architectures for parallel discrete event simulation, Proceedings of the 8th European Simulation Symposium (ESS'96 2 (1996) 374-378.
210. S.B. Seidman, Network structure and minimum diameter, Social Networks 5 (1983) No. 3, 269-287.
211. J. Šiagiová, Minimum diameter lifts of complete graphs, Proc. Conf. 60th Anniver- sary of the Fac. Civil Eng., Slovak University of Technology, Mathematics and Physics, Bratislava (1998) 229-233.
212. J. Šiagiová, Composition of regular coverings of graphs, J. Electrical Engg. 50 (1999) No. 10, 75-77.
213. J. Šiagiová, A note on the McKay-Miller-Širáň graphs, Journal of Combinatorial Theory B 81 (2001) 205-208.
214. J. Šiagiová, A Moore-like bound for graphs of diameter 2 and given degree obtain ed as regular lifts of small graphs, Acta Math. Univ. Comen., to appear.
215. J. Šiagiová, Composition of regular coverings of graphs and voltage assignments, Australasian J. Combin., to appear.
216. J. Šiagiová, Permutation voltage assignments and constructions of large (Δ, D)- graphs, in preparation.
217. J. Šiagiová, and R. Simanjuntak, A Moore bound for graphs embedded in surfaces, submitted.
218. R. Simanjuntak and E.T. Baskoro, The uniqueness of almost Moore digraphs with degree 4 and diameter 2, Proceeding ITB 32:1 (2000) 7-11.
219. R. Simanjuntak and M. Miller, Largest planar digraphs of diameter two, Proceedings of AWOCA'02, Frazer Island, Australia, July 2002, 43-52.
220. Slamin, Diregularity of Digraphs Close to Moore Bound, PhD Thesis, Department of Computer Science and Software Engineering, The University of Newcastle (2001).
221. Slamin, E. T. Baskoro and M. Miller, Diregularity of digraphs of out-degree three and order two less than Moore bound, Proceedings of AWOCA'01, Bandung, In- donesia, July 2001, 167-173.
222. Slamin and M. Miller, Diregularity of digraphs close to Moore bound, Prosiding Konperensi Nasional Matematika X, MIHMI 6 (2000) No. 5, 185-192.
223. W.F. Smyth, The construction of large graphs of given maximum degree and diam- eter, Congressus Numerantium 51 (1986) 277-285.
224. W.F. Smyth, An upper bound on the order of graphs of given maximum degree and diameter, Congressus Numerantium 57 (1987) 201-211.
225. J. Soares, Maximum diameter of regular digraphs, Journal of Graph Theory 16 (1992) No. 5, 437-450.
226. T. Soneoka, Super edge-connectivity of dense digraphs and graphs, Discrete Appl. Mathematics 37/38 (1992) 511-523.
227. R. Stanton and D. Cowan, Note on a "square" functional equation, SIAM Review 12 (1970) 277-279.
228. R.G. Stanton, S.T.E. Seah and D.D. Cowan, Nonexistence of an extremal graph of a certain type, J. Austral. Math. Soc. (Series A) 30 (1980) 55-64.
229. R.M. Storwick, Improved Construction Techniques for (d, k) Graphs, IEEE Trans. on Computers (1970) 1214-1216.
230. S.A. Tishchenko, The maximum size of a planar graph (Δ = 3, D = 3), Fundam. Prikl, Math. 7 (2001) No. 1, 159-171.
231. S.A. Tishchenko, The maximum order of a graph of diameter 2 with a fixed Euler characteristic, Fundam. Prikl, Math. 7 (2001) No. 4, 1203-1225.
232. S. Toueg and K. Steiglitz, The design of small-diameter network by local search, IEEE Trans. on Computers C-28 (1979) 537-542.
233. M.E. Watkins, Connectivity of transitive graphs, Journal of Combinatorial Theory 8 (1970) 23-29.
234. C.K. Wong, A combinatorial problem related to multimodule memory organization, J. Ass. Comput. Mach. 21 (1974) 392-402.
235. C. K. Wong, D. Coppersmith, A combinatorial problem related to multimodule memory organizations, J. ACM 21 (1974) 392-402.
236. P.K. Wong, Cages - a survey, J. Graph Theory 6 (1982) No. 1, 1-22.
237. J.M. Xu, An inequality relating the order, maximum degree, diameter and connec- tivity of a strongly connected digraph. Acta Math. Appl. Sinica (English Ser.) 8 (1992) No. 2, 144-152.
238. J.M. Xu and K. Xu, On k-diameter of k-connected graphs, Appl. Math. J. Chinese vUniv. Ser. B 16 (2001) No. 3, 231-236.
239. Y. Yang and J. Lin, Largest planar graphs and largest maximal planar graphs diameter two, J. Comput. Appl. Math. 144 (2002) No. 1-2, 349-358.
240. J.L.A. Yebra, M.A. Fiol and J. Fábrega, Semiregular bipartite Moore graphs, Ars Combin. 16 (1983) 131-139.
241. A.J. van Zanten, A short proof of a theorem of Bannai and Ito, Discrete Mathematics 78 (1989) 321-325.
242. A. Zlatoš, The diameter of lifted digraphs, Australasian J. Combin. 19 (1999) 73-82.
243. Š Znám On existence and regularity of graphs with certain properties, Discrete Mathematics 16 (1976) 83-90.