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 条
  • [21] USING BOUNDED DEGREE SPANNING-TREES IN THE DESIGN OF EFFICIENT ALGORITHMS ON CLAW-FREE GRAPHS
    CHROBAK, M
    NAOR, J
    NOVICK, MB
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 147 - 162
  • [22] Spanning trees with a bounded number of leaves in a claw-free graph
    Kano, Mikio
    Kyaw, Aung
    Matsuda, Haruhide
    Ozeki, Kenta
    Saito, Akira
    Yamashita, Tomoki
    ARS COMBINATORIA, 2012, 103 : 137 - 154
  • [23] Hamiltonian properties of almost locally connected claw-free graphs
    Chen, Xiaodong
    Li, MingChu
    Liao, Wei
    Broersma, Hajo
    ARS COMBINATORIA, 2016, 124 : 95 - 109
  • [24] Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph
    Haruhide Matsuda
    Kenta Ozeki
    Tomoki Yamashita
    Graphs and Combinatorics, 2014, 30 : 429 - 437
  • [25] Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph
    Matsuda, Haruhide
    Ozeki, Kenta
    Yamashita, Tomoki
    GRAPHS AND COMBINATORICS, 2014, 30 (02) : 429 - 437
  • [26] The *-closure for graphs and claw-free graphs
    Cada, Roman
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5585 - 5596
  • [27] Pancyclicity in claw-free graphs
    Gould, RJ
    Pfender, F
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 151 - 160
  • [28] -Connectivity of Claw-Free Graphs
    Huang, Ziwen
    Li, Xiangwen
    Ma, Jianqing
    GRAPHS AND COMBINATORICS, 2017, 33 (01) : 123 - 140
  • [29] Claw-free graphs - A survey
    Faudree, R
    Flandrin, E
    Ryjacek, Z
    DISCRETE MATHEMATICS, 1997, 164 (1-3) : 87 - 147
  • [30] The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs
    Di Marco, N.
    Frosini, A.
    Picouleau, C.
    DISCRETE APPLIED MATHEMATICS, 2024, 355 : 232 - 246
12345