On the Connectivity of Semiregular Cages
An ({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. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 56(1), 81-88 2010
connectivity semiregular cage cage degree set girth