For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallest currently known $k$--regular graphs of girth $5$ have the same orders as the girth $5$ graphs obtained by the following construction: take a (not necessarily Desarguesian) elliptic semiplane $\cal S$ of order $n-1$ where $n = k - r$ for some $r \ge 1$; the Levi graph $\varGamma({\cal S})$ of $\cal S$ is an $n$--regular graph of girth $6$; parallel classes of $\cal S$ induce co--cliques in $\varGamma({\cal S})$, some of which are eventually deleted; the remaining co--cliques are amalgamated with suitable $r$--regular graphs of girth at least $5$. For $k > 20$, this construction yields some new instances underbidding the smallest orders known so far
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few verti...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallest currently known $k$--regular graphs of g...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallestcurrently known $k$--regular graphs of gi...
In this paper we obtain $(q+3)$--regular graphs of girth $5$ with fewer vertices than previously kno...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
Murty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] constructed a...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
In this paper, we construct new infinite families of regular graphs of girth 7 of smallest order kno...
An edge-girth-regular egr(v, k, g, lambda)-graph Gamma is a k-regular graph of order v and girth g i...
In this note we construct a new infinite family of (q−1)-regular graphs of girth8 and order 2q(q−1)^...
In this note we construct a new infinite family of (q - 1)-regular graphs of girth 8 and order 2q(q ...
AbstractMurty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] const...
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few verti...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallest currently known $k$--regular graphs of g...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallestcurrently known $k$--regular graphs of gi...
In this paper we obtain $(q+3)$--regular graphs of girth $5$ with fewer vertices than previously kno...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
Murty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] constructed a...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
In this paper, we construct new infinite families of regular graphs of girth 7 of smallest order kno...
An edge-girth-regular egr(v, k, g, lambda)-graph Gamma is a k-regular graph of order v and girth g i...
In this note we construct a new infinite family of (q−1)-regular graphs of girth8 and order 2q(q−1)^...
In this note we construct a new infinite family of (q - 1)-regular graphs of girth 8 and order 2q(q ...
AbstractMurty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] const...
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few verti...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs...