Murty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] constructed a family of $(pm + 2)$- regular graphs of girth five and order $2p^{2m}$, where $p \ge 5$ is a prime, which includes the Hoffman–Singleton graph [A.J. Hoffman, R.R. Singleton, On Moore graphs with diameters 2 and 3, IBM J. (1960) 497–504]. This construction gives an upper bound for the least number $f (k)$ of vertices of a $k$-regular graph with girth 5. In this paper, we extend the Murty construction to $k$-regular graphs with girth 5, for each $k$. In particular, we obtain new upper bounds for $f (k)$, $k \ge 16$
The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existenc...
Let k ≥ 1 be an odd integer, t = ⌊ k+2 ⌋, and q be a prime power. We 4 construct a bipartite, q–reg...
In this article, some structures in the projective plane of order q are found which allow us to cons...
Murty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] constructed a...
AbstractMurty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] const...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
In this paper we obtain $(q+3)$--regular graphs of girth $5$ with fewer vertices than previously kno...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
In this paper, we construct new infinite families of regular graphs of girth 7 of smallest order kno...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallest currently known $k$--regular graphs of g...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallestcurrently known $k$--regular graphs of gi...
AbstractWe give a graph of girth 5 and valency 5 having 30 vertices. It is shown that this is the mi...
In this note we construct a new infinite family of (q−1)-regular graphs of girth8 and order 2q(q−1)^...
The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existenc...
Let k ≥ 1 be an odd integer, t = ⌊ k+2 ⌋, and q be a prime power. We 4 construct a bipartite, q–reg...
In this article, some structures in the projective plane of order q are found which allow us to cons...
Murty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] constructed a...
AbstractMurty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] const...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
In this paper we obtain $(q+3)$--regular graphs of girth $5$ with fewer vertices than previously kno...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
In this paper, we construct new infinite families of regular graphs of girth 7 of smallest order kno...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallest currently known $k$--regular graphs of g...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
For $3 \le k \le 20$ with $k \ne 4,8,12$, all the smallestcurrently known $k$--regular graphs of gi...
AbstractWe give a graph of girth 5 and valency 5 having 30 vertices. It is shown that this is the mi...
In this note we construct a new infinite family of (q−1)-regular graphs of girth8 and order 2q(q−1)^...
The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existenc...
Let k ≥ 1 be an odd integer, t = ⌊ k+2 ⌋, and q be a prime power. We 4 construct a bipartite, q–reg...
In this article, some structures in the projective plane of order q are found which allow us to cons...