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).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 53-57 |
| Number of pages | 5 |
| Journal | Graphs and Combinatorics |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics