On mixed Moore graphs

The Moore bound for a directed graph of maximum out-degree d and diameter k is M"d","k=1+d+d^2+...+d^k. It is known that digraphs of order M"d","k (Moore digraphs) do not exist for d>1 and k>1. Similarly, the Moore bound for an undirected graph of maximum degree d and diameter k is M"d","k^*=1+d+d(d-1)+...+d(d-1)^k^-^1. Undirected Moore graphs only exist in a small number of cases. Mixed (or partially directed) Moore graphs generalize both undirected and directed Moore graphs. In this paper, we shall show that all known mixed Moore graphs of diameter k=2 are unique and that mixed Moore graphs of diameter k>=3 do not exist.

[1]  Joan Gimbert,et al.  Enumeration of almost Moore digraphs of diameter two , 2001, Discret. Math..

[2]  R. M. Damerell.  On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Joan Gimbert,et al.  On the existence of ( d,k )-digraphs , 1999 .

[4]  E. Bannai,et al.  On finite Moore graphs , 1973 .

[5]  J. Gimbert,et al.  On digraphs with unique walks of closed lengths between vertices , 1999, Australas. J Comb..

[6]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[7]  Juraj Bosák,et al.  Partially directed Moore graphs , 1979 .

[8]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[9]  Art M. Duval.  A directed graph version of strongly regular graphs , 1988, J. Comb. Theory, Ser. A.

[10]  Juraj Bosák.  Graphs with unique walks, trails or paths of given lengths , 1978 .

[11]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.