A Note on the Edge-Connectivity of Cages

  • Ping Wang
  • Baoguang Xu
  • Jianfang Wang
DOI: https://doi.org/10.37236/1742

Abstract

A $(k;g)$-graph is a $k$-regular graph with girth $g$. A $(k;g)$-cage is a $(k;g)$-graph with the smallest possible number of vertices. In this paper we prove that $(k;g)$-cages are $k$-edge-connected if $k \geq 3$ and $g$ is odd.

Published
2003-04-15
Issue
Volume 10 (2003)
Article Number
N2