On Superconnectivity of (4, g)-Cages
- First Online:
- Cite this article as:
- Lu, H., Wu, Y., Lin, Y. et al. Graphs and Combinatorics (2013) 29: 105. doi:10.1007/s00373-011-1091-5
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth g. It has been conjectured (Fu et al. in J. Graph Theory, 24:187–191, 1997) that all (k, g)-cages are k-connected for every k ≥ 3. A k-connected graph G is called superconnected if every k-cutset S is the neighborhood of some vertex. Moreover, if G−S has precisely two components, then G is called tightly superconnected. In this paper, we prove that every (4, g)-cage is tightly superconnected when g ≥ 11 is odd.
KeywordsCage Superconnected Tightly superconnected
Unable to display preview. Download preview PDF.