Improved lower bound for the vertex connectivity of image-cages Original Research Article

A image-cage is a image-regular graph with girth g and with the least possible number of vertices. We prove that all image-cages are r-connected with image for image odd. This result supports the conjecture of Fu, Huang and Rodger that all image-cages are image-connected.