AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3, 10)-cage) must have 70 vertices. There are three non-isomorphic (3, 10)-cages which have been known for some while. In this paper, it is shown that these are the only three possible (3, 10)-cages. Some of the proofs in this paper are derived with the aid of a computer
AbstractA (δ,g)-cage is a regular graph of degree δ and girth g with the least possible number of ve...
A (k; g, h)-graph is a k-regular graph of girth pair (g, h) where g is the girth of the graph, h is ...
ABSTRACT. Let f(ll,6) be the number of vertices of an (ll,6)-cage. By giving a reg-ular graph of gir...
AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,...
AbstractA (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum ...
A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. W...
AbstractWe give a regular graph of girth 10 and valency 3 which has 70 vertices. We also show that n...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
We investigate the basic interplay between the small k-valent vertex-transitive graphs of girth g an...
Abstract: A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show tha...
AbstractGiven three positive integers r,m and g, one interesting question is the following: What is ...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractA (δ,g)-cage is a regular graph of degree δ and girth g with the least possible number of ve...
A (k; g, h)-graph is a k-regular graph of girth pair (g, h) where g is the girth of the graph, h is ...
ABSTRACT. Let f(ll,6) be the number of vertices of an (ll,6)-cage. By giving a reg-ular graph of gir...
AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,...
AbstractA (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum ...
A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. W...
AbstractWe give a regular graph of girth 10 and valency 3 which has 70 vertices. We also show that n...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
We investigate the basic interplay between the small k-valent vertex-transitive graphs of girth g an...
Abstract: A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show tha...
AbstractGiven three positive integers r,m and g, one interesting question is the following: What is ...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractA (δ,g)-cage is a regular graph of degree δ and girth g with the least possible number of ve...
A (k; g, h)-graph is a k-regular graph of girth pair (g, h) where g is the girth of the graph, h is ...
ABSTRACT. Let f(ll,6) be the number of vertices of an (ll,6)-cage. By giving a reg-ular graph of gir...
DOI
Add to ORKG