The Moore Bound for Irregular Graphs

Abstract. What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result is extended here to cover irregular graphs as well, yielding an affirmative answer to an old open problem ([4] p. 163, problem 10).

[1]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[2]  Norman Biggs,et al.  Graphs with even girth and small excess , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Ronald D. Dutton,et al.  Edges in graphs with large girth , 1991, Graphs Comb..

[4]  Tatsuro Ito,et al.  Regular graphs with excess one , 1981, Discret. Math..

[5]  Peter Kovács.  The non-existence of certain regular graphs of girth 5 , 1981, J. Comb. Theory, Ser. B.

[6]  Pak-Ken Wong,et al.  Cages - a survey , 1982, J. Graph Theory.