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-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 条
  • [31] Pancyclism in Claw-free Graphs
    陆玫
    俞正光
    Tsinghua Science and Technology, 1998, (04) : 1218 - 1220
  • [32] Triangles in claw-free graphs
    Wang, H
    DISCRETE MATHEMATICS, 1998, 187 (1-3) : 233 - 244
  • [33] Hamiltonian problem on claw-free and almost distance-hereditary graphs
    Feng, Jinfeng
    Guo, Yubao
    DISCRETE MATHEMATICS, 2008, 308 (24) : 6558 - 6563
  • [34] FACTORS OF CLAW-FREE GRAPHS
    LONC, Z
    RYJACEK, Z
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1991, 41 (01) : 120 - 130
  • [35] Minimal claw-free graphs
    Dankelmann, P.
    Swart, Henda C.
    van den Berg, P.
    Goddard, W.
    Plummer, M. D.
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2008, 58 (03) : 787 - 798
  • [36] CIRCUMFERENCES OF CLAW-FREE GRAPHS
    SUN Zhiren
    WU Zhengsheng (School of Mathematics and Computer Science
    Systems Science and Mathematical Sciences, 2000, (02) : 225 - 225
  • [37] ON HAMILTONIAN CLAW-FREE GRAPHS
    FLANDRIN, E
    FOUQUET, JL
    LI, H
    DISCRETE MATHEMATICS, 1993, 111 (1-3) : 221 - 229
  • [38] Minimal claw-free graphs
    P. Dankelmann
    Henda C. Swart
    P. van den Berg
    W. Goddard
    M. D. Plummer
    Czechoslovak Mathematical Journal, 2008, 58
  • [39] Equimatchable claw-free graphs
    Akbari, Saieed
    Alizadeh, Hadi
    Ekim, Tinaz
    Gozupek, Didem
    Shalom, Mordechai
    DISCRETE MATHEMATICS, 2018, 341 (10) : 2859 - 2871
  • [40] DEGREE CONDITIONS FOR CLAW-FREE GRAPHS TO HAVE SPANNING TREES WITH AT MOST FIVE BRANCH VERTICES AND LEAVES IN TOTAL
    Dang Dinh Hanh
    STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2022, 59 (01) : 58 - 66