Nov 14, 2011 · Abstract:In this paper we obtain (q+3)--regular graphs of girth 5 with fewer vertices than previously known ones for q=13,17,19 and for any ...
Families of small regular graphs of girth 5 - ScienceDirect.com
www.sciencedirect.com › article › pii
Hence, the graphs G 1 and G 2 have order 13, girth 5 and are bi-regular with one vertex of degree four and all other vertices of degree three.
A ( k , g ) -cage is a k-regular graph of girth g of minimum order. In this work, we focus on girth g = 5 , where cages are known only for degrees k ≤ 7 .
All the graphs considered are finite and simple. Let G be a graph with vertex set V and edge set E. The girth of a graph G is the length g = g(G) of.
In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ ...
Families of small regular graphs of girth 5.
A (k,g)-graph is a k-regular graph with girth g and a (k,g)-cage is a (k,g)-graph with the fewest possible number of vertices. The cage problem consists of ...
In this paper we obtain (q + 3 − u)-regular graphs of girth 5, for 1 ≤ u ≤ q − 1 with fewer vertices than previously known ones, for each prime q ≥ 13, ...
Labbate, Families of small regular graphs of girth 5, Discrete Math. 312 ... Napolitano, A family of regular graphs of girth 5, Discrete Math. 308 (10) ...
In this paper we are interested in the Cage Problem that consists in constructing regular graphs of given girth g and minimum order. We focus on girth g=5, ...