关于元爪图的一个性质

数学季刊 ›› 2011, Vol. 26 ›› Issue (3): 445-447.

关于元爪图的一个性质

1. Department of Mathematics and Physics ,Zhengzhou Institute of Aeronautical Industry Management2. Zhengzhou Railway Vocational and Technical College 3. Kaifeng Gongyuan Road East Street Elementary School

收稿日期:2008-11-30 出版日期:2011-09-30 发布日期:2023-04-24
作者简介:LU Xiao-xu(1975-), male, native of Changge, Henan, a lecturer of Zhengzhou Institute of Aeronautical Industry Management, Ph.D., engages in graph theory and combinatorial optimization.
基金资助:
Supported by the National Natural Sciences Youth Foundation(10901144)；

A Property of Claw-free Graphs

1. Department of Mathematics and Physics, Zhengzhou Institute of Aeronautical Industry Management2. Zhengzhou Railway Vocational and Technical College 3. Kaifeng Gongyuan Road East Street Elementary School

Received:2008-11-30 Online:2011-09-30 Published:2023-04-24
About author:LU Xiao-xu(1975-), male, native of Changge, Henan, a lecturer of Zhengzhou Institute of Aeronautical Industry Management, Ph.D., engages in graph theory and combinatorial optimization.
Supported by:
Supported by the National Natural Sciences Youth Foundation(10901144)；

摘要/Abstract

摘要： In this paper we consider a property of claw-free graphs. We show that if d(u)+ d(v)≥ν(G)+2k+3, for every two nonadjacent vertices u and v, then G is 2k-vertex-deletable IM-extendable, where ν(G)=|V(G)|. And the bound is tight.

关键词: IM-extendable, vertex-deletable IM-extendable, claw-free graph

Abstract: In this paper we consider a property of claw-free graphs. We show that if d(u)+ d(v)≥ν(G)+2k+3, for every two nonadjacent vertices u and v, then G is 2k-vertex-deletable IM-extendable, where ν(G)=|V(G)|. And the bound is tight.

Key words: IM-extendable, vertex-deletable IM-extendable, claw-free graph

中图分类号:

O157.5

鲁晓旭, 李静, 吴敏. 关于元爪图的一个性质[J]. 数学季刊, 2011, 26(3): 445-447.

LU Xiao-xu, LI Jing, WU Min. A Property of Claw-free Graphs [J]. Chinese Quarterly Journal of Mathematics, 2011, 26(3): 445-447.

[1]	陈祥恩, 马彦荣. 图2Cn的点可区别全染色[J]. 数学季刊, 2013, 28(3): 323-330.
[2]	郇潇, 鲁红亮, 于青林. Factor-critical 图的阈值[J]. 数学季刊, 2013, 28(3): 417-427.
[3]	马小玲, 田应智. 逆度和连通度[J]. 数学季刊, 2013, 28(2): 257-260.
[4]	曹向东, 刘峙山. K_n的H₂-cordiality性[J]. 数学季刊, 2012, 27(2): 191-195.
[5]	冶成福. Hosoya指标在一个闭区间的一类树的刻画[J]. 数学季刊, 2012, 27(2): 308-316.
[6]	卢世芳, 赵海兴. 完全多部图的无符号Laplacian特征多项式[J]. 数学季刊, 2012, 27(1): 36-40.
[7]	何小年. 五阶图与星图的笛卡尔积交叉数[J]. 数学季刊, 2011, 26(4): 563-567.
[8]	董丽, 汤京永, 宋新宇. 3-正则无爪图的导出匹配覆盖[J]. 数学季刊, 2011, 26(3): 355-359.
[9]	王彦辉, 汪雄良, 吴果林. 交叉立方体的等价定义[J]. 数学季刊, 2011, 26(2): 234-238.
[10]	张海辉 . 无6-圈平面图的不完全选色性[J]. 数学季刊, 2010, 25(4): 510-514.
[11]	张振坤, 高风昕. 补树的扩充侧廓[J]. 数学季刊, 2010, 25(4): 515-521.
[12]	温一慧. 关于图的一致平衡性[J]. 数学季刊, 2010, 25(4): 565-571.
[13]	谭尚旺. 关于树的拉普拉斯谱半径[J]. 数学季刊, 2010, 25(4): 615-625.
[14]	王牟江山, 原军, 林上为等. 顺序和顺序哈密顿有向图[J]. 数学季刊, 2010, 25(3): 317-326.
[15]	李德明, 刘明菊. 关于圈幂图的关联着色数[J]. 数学季刊, 2010, 25(2): 159-167.