Spanning trees with bounded degrees and leaves

Spanning trees with bounded degrees and leaves
复制标题

具有有限度和叶子的生成树

DOI：
10.1016/j.disc.2015.12.023
复制
发表时间：
2016
期刊：
Discrete Mathemtics
影响因子：
--
通讯作者：
M. Kano and Zheng Yan
M. Kano and Zheng Yan
中科院分区：
--
文献类型：
--
作者：
S. Akbari;M. Kano;S. Zare;三橋秀生;Yoshio Yamada;M. Kano and Zheng Yan

文献摘要

相似文献

Rivera-Campo给出了一个度和条件，使得一个图的生成树的度和叶子都有界。本文给出了一个图具有有界度和叶子的生成树的独立数条件，这也部分解决了Enomoto和Ozeki（2010）的猜想.
Rivera-Campo provided a degree sum condition for a graph to have a spanning tree with bounded degrees and leaves. In this paper, we give an independence number condition for a graph to have a spanning tree with bounded degrees and leaves, which also partially solves the conjecture made by Enomoto and Ozeki (2010).