A Note on Z3 -Connected Graphs with Degree Sum Condition

被引:0
作者
Xin Min HOU [1 ]
机构
[1] Department of Mathematics, University of Science and Technology of China
基金
中国国家自然科学基金; 中央高校基本科研业务费专项资金资助;
关键词
Group connectivity; degree sum condition;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
A graph G satisfies the Ore-condition if d(x) + d(y) ≥ | V (G) | for any xy ■ E(G). Luo et al. [European J. Combin., 2008] characterized the simple Z3-connected graphs satisfying the Ore-condition. In this paper, we characterize the simple Z3-connected graphs G satisfying d(x) + d(y) ≥ | V (G) |-1 for any xy ■ E(G), which improves the results of Luo et al.
引用
收藏
页码:2161 / 2168
页数:8
相关论文
共 5 条
[1]   Degree sum condition for Z3-connectivity in graphs [J].
Zhang, Xiaoxia ;
Zhan, Mingquan ;
Xu, Rui ;
Shao, Yehong ;
Li, Xiangwen ;
Lai, Hong-Jian .
DISCRETE MATHEMATICS, 2010, 310 (23) :3390-3397
[2]   Nowhere-zero 3-flows in triangularly connected graphs [J].
Fan, Genghua ;
Lai, Hongjian ;
Xu, Rui ;
Zhang, Cun-Quan ;
Zhou, Chuixiang .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (06) :1325-1336
[3]   An equivalent version of the 3-flow conjecture [J].
Kochol, M .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 83 (02) :258-261
[4]  
Group connectivity of graphs-A nonhomoge-neous analogue of nowhere zero flow properties. Jaeger F,Linial N,Payan C,Tarsi N. Journal of Combinatorial Theory Series B . 1992
[5]  
Graph Theory with Applications. Bondy J A, Murty U S R. North-Holland . 1976