ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2018-2019): c. 84%

Discussiones Mathematicae Graph Theory

Article in press


R. Jajcay, T. Raiman


Spectra of orders for $k$-regular graphs of girth $g$


Discussiones Mathematicae Graph Theory

Received: 2018-09-15, Revised: 2019-05-31, Accepted: 2019-05-31,


A $(k,g)$-graph is a $k$-regular graph of girth $g$. Given $k \geq 2$ and $g \geq 3$, infinitely many $(k,g)$-graphs of infinitely many orders are known to exist. Our goal, for given $k$ and $g$, is the classification of all orders $n$ for which a $(k,g)$-graph of order $n$ exists; we choose to call the set of all such orders the spectrum of orders of $(k,g)$-graphs. The smallest of these orders (the first element in the spectrum) is the order of a $(k,g)$-cage; the $(k,g)$-graph of the smallest possible order. The exact value of this order is unknown for the majority of parameters $(k,g)$. We determine the spectra of orders for $(2,g)$, $g\geq 3$, $(k,3)$, $k\geq 2$, and $(3,5)$-graphs, as well as the spectra of orders of some families of $(k,4)$-graphs. In addition, we present methods for obtaining $(k,g)$-graphs that are larger then the smallest known $(k,g)$-graphs, but are smaller than $(k,g)$-graphs obtained by Sauer. Our constructions start from $(k,g)$-graphs that satisfy specific conditions derived in this paper and result in graphs of orders larger than the original graphs by one or two vertices. We present theorems describing ways to obtain `starter graphs' whose orders fall in the gap between the well-known Moore bound and the constructive bound derived by Sauer and are the first members of an infinite sequence of graphs whose orders cover all admissible orders larger than those of the `starter graphs'.


cage,$k$-regular graph, girth, Sauer bound