A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper we give a brief overview of the current results on the connectivity of (k,g)-cages and we improve the current known best lower bound on the vertex connectivity of (k,g)-cages for g even
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 ...
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 ...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In th...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In th...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
A (delta, g)-cage is a delta-regular graph with girth g and with the least possible number of vertic...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
A (k;g)-cage is k-regular graph with girth g and with the least possible number of vertices. In this...
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 ...
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 ...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In th...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In th...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
A (delta, g)-cage is a delta-regular graph with girth g and with the least possible number of vertic...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
A (k;g)-cage is k-regular graph with girth g and with the least possible number of vertices. In this...
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 ...
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 ...
© 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
DOI
Add to ORKG