AbstractA (D;g)-cage is a graph having degree set D, girth g, and the minimum possible number of vertices, which is denoted by n(D;g). When D={r} the corresponding ({r};g)-cage is clearly r-regular, and is called an (r;g)-cage. In this work we prove that if g<g′ then n(D;g)<n(D;g′) under certain requirements on the elements of the degree set D or on the girth g
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
An ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible orde...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least num...
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...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
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 ...
AbstractBy an ({r,m};g)-cage we mean a graph on a minimum number of vertices f({r,m};g) with degree ...
AbstractGiven three positive integers r,m and g, one interesting question is the following: What is ...
A (k, g)-Cayley cage is a k-regular Cayley graph of girth g and smallest possible order. We present ...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In th...
A (k, g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the resul...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
An ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible orde...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least num...
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...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
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 ...
AbstractBy an ({r,m};g)-cage we mean a graph on a minimum number of vertices f({r,m};g) with degree ...
AbstractGiven three positive integers r,m and g, one interesting question is the following: What is ...
A (k, g)-Cayley cage is a k-regular Cayley graph of girth g and smallest possible order. We present ...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In th...
A (k, g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the resul...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
An ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible orde...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
DOI
Add to ORKG