Connectivity of cages

A (k; g)-graph is a k-regular graph with girth g. Let f(k; g) be the smallest integer v such there exists a (k; g)-graph with v vertices. A (k; g)-cage is a (k; g)-graph with f(k; g) vertices. In this paper we prove that the cages are monotonic in that f(k; g₁) < f(k; g₂) for all k ≥ 3 and 3 ≥ g₁ < g₂. We use this to prove that (k; g)-cages are 2-connected, and if k = 3 then their connectivity is k. © 1997 John Wiley & Sons, Inc.