Email this article A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6
- Authors: Simarova E.N.1
-
Affiliations:
- St. Peterburg State University
- Issue: Vol 236, No 5 (2019)
- Pages: 542-553
- Section: Article
- URL: https://journal-vniispk.ru/1072-3374/article/view/242264
- DOI: https://doi.org/10.1007/s10958-018-4132-2
- ID: 242264
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
E. N. Simarova
St. Peterburg State University
Author for correspondence.
Email: katerina.1.14@mail.ru
Russian Federation, St. Peterburg
Supplementary files
