Add to ORKGAn ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge-connected and 2-connected. As a consequence, ({3,4};g)-cages are proved to be maximally connected
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractA regular graph G of degree δ and girth g is said to be a (δ,g)-cage if it has the least num...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
A graph with degree set {r,r + 1} is said to be semiregular. A semiregular cage is a semiregular gra...
Graphs and AlgorithmsA graph with degree set \r, r + 1\ is said to be semiregular. A semiregular cag...
A semiregular cage is a graph with degree set {r,r +1}, girth g and the smallest possible order. In ...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
Abstract: A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show tha...
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 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...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractA regular graph G of degree δ and girth g is said to be a (δ,g)-cage if it has the least num...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
A graph with degree set {r,r + 1} is said to be semiregular. A semiregular cage is a semiregular gra...
Graphs and AlgorithmsA graph with degree set \r, r + 1\ is said to be semiregular. A semiregular cag...
A semiregular cage is a graph with degree set {r,r +1}, girth g and the smallest possible order. In ...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
Abstract: A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show tha...
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 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...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractA regular graph G of degree δ and girth g is said to be a (δ,g)-cage if it has the least num...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...