Super Cyclically Edge Connected Half Vertex Transitive Graphs

• 作者: Haining Jiang Jixiang Meng Yingzhi Tian
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: Cyclic EDGE-CONNECTIVITY Cyclically Optimal Super Cyclically Edge-Connected HALF VERTEX TRANSITIVE Graph
• 年，卷（期）: 2013,（2）
• 页码范围: 348-351
• 页数: 4页
• 分类号: O1

摘要

Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity k and girth g(G) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree δ(G) ≥ 6 and girth g(G) ≥ 6.