Publication date
May 1992
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractWe consider the problem of constructing minimal graphs of given girth having a particular degree set
AbstractWe consider the problem of constructing minimal graphs of given girth having a particular degree set
AbstractConstructing regular graphs with a given girth, a given degree and the fewest possible verti...
AbstractA regular graph G of degree δ and girth g is said to be a (δ,g)-cage if it has the least num...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
AbstractA (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum ...
AbstractBy an ({r,m};g)-cage we mean a graph on a minimum number of vertices f({r,m};g) with degree ...
AbstractThe girth pair of a graph G is the pair (a, b) where a and b are the lengths of shortest eve...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
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...
AbstractGiven three positive integers r,m and g, one interesting question is the following: What is ...
The objective of this thesis is to study cages, constructions and properties of such families of gra...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
AbstractCaccetta and Häggkvist conjectured that the minimum order of a directed graph with girth g a...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractConstructing regular graphs with a given girth, a given degree and the fewest possible verti...
AbstractA regular graph G of degree δ and girth g is said to be a (δ,g)-cage if it has the least num...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
AbstractA (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum ...
AbstractBy an ({r,m};g)-cage we mean a graph on a minimum number of vertices f({r,m};g) with degree ...
AbstractThe girth pair of a graph G is the pair (a, b) where a and b are the lengths of shortest eve...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
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...
AbstractGiven three positive integers r,m and g, one interesting question is the following: What is ...
The objective of this thesis is to study cages, constructions and properties of such families of gra...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
AbstractCaccetta and Häggkvist conjectured that the minimum order of a directed graph with girth g a...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractConstructing regular graphs with a given girth, a given degree and the fewest possible verti...
AbstractA regular graph G of degree δ and girth g is said to be a (δ,g)-cage if it has the least num...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
Add to ORKG