Small radial Moore graphs of radius 3

A t-regular graph of radius s is radial Moore if it has diameter at most s +1 and 1 +t + t(t−1) + ... + t(t−1) s−1 vertices. We construct radial Moore graphs of radius 3 and degrees t =3 , 5, 7, 9, 10 ,..., 30 with at least t + 1 central vertices and at most t + 2 orbits under the automorphism group.

[1]  Geoffrey Exoo,et al.  Radial Moore graphs of radius three , 2012, Discret. Appl. Math..

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

[3]  Martin Knor,et al.  A Note on Radially Moore Digraphs , 1996, IEEE Trans. Computers.

[4]  J. Sirán,et al.  Moore Graphs and Beyond: A survey of the Degree/Diameter Problem , 2013 .

[5]  Asif Zaman,et al.  MOORE GRAPHS OF DIAMETER 2 AND 3 , 2010 .

[6]  Geoffrey Exoo,et al.  Ranking measures for radially Moore graphs , 2010, Networks.

[7]  Mirka Miller.  An overview of the degree/diameter problem for directed, undirected and mixed graphs , 2011 .

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

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