All (k;g)-cages are edge-superconnected
Yuqing Lin, Mirka Miller, Camino Balbuena, X. Marcote · FedUni ResearchOnline (Federation University Australia) · 2006
A (k;g)-cage is k-regular graph with girth g and with the least possible number of vertices. In this article we prove that (k;g)-cages are edge-superconnected if g is even. Earlier, Marcote and Balbuena proved that (k;g)-cages are edge-superconnected if g is odd [Networks 43 (2004), 54-59]. Combining our results, we conclude that all (k;g)-cages are edge-superconnected. © 2005 Wiley Periodicals, Inc.