We give new constructions for k-regular graphs of girth 6, 8 and 12 with a small number of vertices. The key idea is to start with a generalized n-gon and delete some lines and points to decrease the valency of the incidence graph
AbstractLet k ⩾ 3 be a positive odd integer and 1 be a power of a prime. In this paper we give an ex...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
AbstractIn this paper I construct for each g, l, and m≡0 modulo n a regular n-graph G of degree g an...
We give new constructions for k-regular graphs of girth 6, 8 and 12 with a small number of vertices....
AbstractWe give a construction of k-regular graphs of girth g using only geometrical and combinatori...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
The objective of this thesis is to study cages, constructions and properties of such families of gra...
AbstractConstructing regular graphs with a given girth, a given degree and the fewest possible verti...
AbstractSmall k-regular graphs of girth g where g=6,8,12 are obtained as subgraphs of minimal cages....
AbstractWe give a regular graph of girth 10 and valency 3 which has 70 vertices. We also show that n...
ABSTRACT. Let f(ll,6) be the number of vertices of an (ll,6)-cage. By giving a reg-ular graph of gir...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph ...
AbstractA (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum ...
AbstractMurty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] const...
AbstractLet k ⩾ 3 be a positive odd integer and 1 be a power of a prime. In this paper we give an ex...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
AbstractIn this paper I construct for each g, l, and m≡0 modulo n a regular n-graph G of degree g an...
We give new constructions for k-regular graphs of girth 6, 8 and 12 with a small number of vertices....
AbstractWe give a construction of k-regular graphs of girth g using only geometrical and combinatori...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
The objective of this thesis is to study cages, constructions and properties of such families of gra...
AbstractConstructing regular graphs with a given girth, a given degree and the fewest possible verti...
AbstractSmall k-regular graphs of girth g where g=6,8,12 are obtained as subgraphs of minimal cages....
AbstractWe give a regular graph of girth 10 and valency 3 which has 70 vertices. We also show that n...
ABSTRACT. Let f(ll,6) be the number of vertices of an (ll,6)-cage. By giving a reg-ular graph of gir...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph ...
AbstractA (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum ...
AbstractMurty [A generalization of the Hoffman–Singleton graph, Ars Combin. 7 (1979) 191–193.] const...
AbstractLet k ⩾ 3 be a positive odd integer and 1 be a power of a prime. In this paper we give an ex...
AbstractIn this paper we obtain (q+3−u)-regular graphs of girth 5, for 1≤u≤q−1 with fewer vertices t...
AbstractIn this paper I construct for each g, l, and m≡0 modulo n a regular n-graph G of degree g an...
DOI
Add to ORKG