TITLE:
Super Cyclically Edge Connected Half Vertex Transitive Graphs
AUTHORS:
Haining Jiang, Jixiang Meng, Yingzhi Tian
KEYWORDS:
Cyclic Edge-Connectivity; Cyclically Optimal; Super Cyclically Edge-Connected; Half Vertex Transitive Graph
JOURNAL NAME:
Applied Mathematics,
Vol.4 No.2,
February
27,
2013
ABSTRACT: 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.