电邮这篇文章 A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6
- 作者: Simarova E.N.1
-
隶属关系:
- St. Peterburg State University
- 期: 卷 236, 编号 5 (2019)
- 页面: 542-553
- 栏目: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/242264
- DOI: https://doi.org/10.1007/s10958-018-4132-2
- ID: 242264
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
We prove that a connected graph of minimum degree 6 has a spanning tree such that at least \( \frac{11\ }{21} \) of its vertices are leaves.
作者简介
E. Simarova
St. Peterburg State University
编辑信件的主要联系方式.
Email: katerina.1.14@mail.ru
俄罗斯联邦, St. Peterburg
补充文件
