Author/Authors :
Mike Daven، نويسنده , , C.A. Rodger، نويسنده ,
Abstract :
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth g. It has been conjectured that the connectivity of each (k, g-cage is k, and a proof exists for k = 3. We prove here that all cages are 3-connected, a step towards a proof of the conjecture.
