A sufficient condition for spanning trees with hounded maximum degree in a graph

被引:0
|
作者
Kyaw, Aung [1 ]
机构
[1] Univ East Yanyon, Dept Math, Thanlyin Township, Yanyon 11292, Myanmar
来源
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We obtain a sufficient condition on the degree sequence of a graph which is an improvement to the condition of E. Flandrin, H.A. Jung and H. Li (Discrete Math. 90 (1991), 41-52) for traceability. As a generalization of this condition, a sufficient condition for the existence of a spanning tree with bounded maximum degree in a graph is presented.
引用
收藏
页码:3 / 10
页数:8
相关论文
共 50 条
  • [1] On numbers of vertices of maximum degree in the spanning trees of a graph
    Fac. of Appl. Phys. and Mathematics, Gdańsk Technical University, Narutowicza 11/12, 80-952 Gdańsk, Poland
    不详
    [J]. Discrete Math, 1-3 (247-258):
  • [2] On numbers of vertices of maximum degree in the spanning trees of a graph
    Topp, J
    Vestergaard, PD
    [J]. DISCRETE MATHEMATICS, 1996, 155 (1-3) : 247 - 258
  • [3] A Sufficient Degree Condition for a Graph to Contain All Trees of Size k
    Balbuena, Camino
    Marquez, Alberto
    Ramon Portillo, Jose
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2011, 27 (01) : 135 - 140
  • [4] A sufficient degree condition for a graph to contain all trees of size k
    Camino Balbuena
    Alberto Márquez
    José Ramón Portillo
    [J]. Acta Mathematica Sinica, English Series, 2011, 27 : 135 - 140
  • [5] A sufficient condition for a plane graph with maximum degree 6 to be class 1
    Wang, Yingqian
    Xu, Lingji
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (1-2) : 307 - 310
  • [6] On spanning trees and walks of low maximum degree
    Sanders, DP
    Zhao, Y
    [J]. JOURNAL OF GRAPH THEORY, 2001, 36 (02) : 67 - 74
  • [7] The distribution of node degree in maximum spanning trees
    Willemain, TR
    Bennett, MV
    [J]. JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2002, 72 (02) : 101 - 106
  • [8] Degree condition for completely independent spanning trees
    Hong, Xia
    Liu, Qinghai
    [J]. INFORMATION PROCESSING LETTERS, 2016, 116 (10) : 644 - 648
  • [9] GENERATING THE MAXIMUM SPANNING-TREES OF A WEIGHTED GRAPH
    GAVRIL, F
    [J]. JOURNAL OF ALGORITHMS, 1987, 8 (04) : 592 - 597
  • [10] SUFFICIENT CONDITIONS FOR SPANNING TREES WITH CONSTRAINED LEAF DISTANCE IN A GRAPH
    Chen, Hongzhang
    Lv, Xiaoyun
    Li, Jianxi
    Xu, Shou-Jun
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023,