Add to ORKGA semiregular cage is a graph with degree set {r,r +1}, girth g and the smallest possible order. In this work we prove that semiregular cages with r ≥ 3 and odd girth g ≥ 7 are t-connected with t ≥ |√ r + (3/2)² - 1/2|
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
A graph with degree set {r,r + 1} is said to be semiregular. A semiregular cage is a semiregular gra...
An ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible orde...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
Graphs and AlgorithmsA graph with degree set \r, r + 1\ is said to be semiregular. A semiregular cag...
A (delta, g)-cage is a delta-regular graph with girth g and with the least possible number of vertic...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
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...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...
A graph with degree set {r,r + 1} is said to be semiregular. A semiregular cage is a semiregular gra...
An ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible orde...
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
Graphs and AlgorithmsA graph with degree set \r, r + 1\ is said to be semiregular. A semiregular cag...
A (delta, g)-cage is a delta-regular graph with girth g and with the least possible number of vertic...
A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In t...
A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of ver...
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...
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices....
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cag...
AbstractA (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertice...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges inciden...
AbstractA (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs wi...