Spanning 3-Ended Trees in Almost Claw-Free Graphs

被引：0
|
作者：
Chen, Xiaodong [1 ]
Xu, Meijin [1 ]
Liu, Yanjun [1 ]
机构：
[1] Liaoning Univ Technol, Coll Sci, Jinzhou 121001, Peoples R China
来源：
DISCRETE DYNAMICS IN NATURE AND SOCIETY | 2015年 / 2015卷
基金：
中国国家自然科学基金;
关键词：
DISCRETE-TIME-SYSTEMS; TRACKING CONTROL; BOUNDED NUMBER; LEAVES; DESIGN;
D O I：
10.1155/2015/476182
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that if G is a k-connected (k >= 2) almost claw-free graph of order n and sigma(k+3) (G) >= n + 2k - 2, then G contains a spanning 3-ended tree, where sigma(k)(G) = min{Sigma(v is an element of S) deg(V) : S is an independent set of G with vertical bar S vertical bar = k}.
引用
收藏
页数：5
相关论文
共 50 条
12345