On Superconnectivity of (4, g)-Cages
发布时间：2025-04-30
点击次数：
- 发布时间：
- 2025-04-30
- 论文名称：
- On Superconnectivity of (4, g)-Cages
- 发表刊物：
- Graph and Combinatorics
- 摘要：
- 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.
- 合写作者：
- Hongliang Lu.et.al
- 卷号：
- 2013, Volume 29, Issue 1
- 页面范围：
- 105-119
- 是否译文：
- 否
- 发表时间：
- 2013-12-31