版权说明 操作指南
首页 > 成果 > 详情

Degree sum of a pair of independent edges and Z_3-connectivity

认领
导出
Link by 维普学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Huang, Ziwen;Li, Xiangwen*
通讯作者:
Li, Xiangwen
作者机构:
[Huang, Ziwen; Li, Xiangwen] Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China.
通讯机构:
[Li, Xiangwen] H
Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
Z_3-connectivity;nowhere-zero 3-flow;degree condition
期刊:
中国高等学校学术文摘·数学
ISSN:
1673-3452
年:
2016
卷:
11
期:
6
页码:
1533-1567
基金类别:
Acknowledgements The first author was supported by the Excellent Doctorial Dissertation Cultivation Grant from Huazhong Normal University (2013YBYB42). The second author was supported in part by the National Natural Science Foundation of China (Grant No. 11171129) and the Doctoral Fund of Ministry of Education of China (Grant No. 20130144110001).
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学学院
摘要:
Let G be a 2-edge-connected simple graph on n vertices. For an edge e = uv ∈ E(G), define d(e) = d(u) + d(v). Let F denote the set of all simple 2-edge-connected graphs on n ≥ 4 vertices such that G ∈ F if and only if d(e) + d(e')≥ 2n for every pair of independent edges e, e' of G. We prove in this paper that for each G ∈ F,G is not Z_3-connected if and only if G is one of K_(2,n-2), K_(3.n-3)~+ or one of the 16 specified graphs, which generalizes the results of X. Zhang et al. [Discrete Math., 2010, 310: 3390—3397] and G. F...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com