Advertisement

Journal of Mathematical Sciences

, Volume 236, Issue 5, pp 542–553 | Cite as

A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6

  • E. N. SimarovaEmail author
Article
  • 14 Downloads

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. R. Griggs and M. Wu, “Spanning trees in graphs of minimum degree 4 or 5,” Discrete Math., 104, 167–183 (1992).MathSciNetCrossRefGoogle Scholar
  2. 2.
    D. J. Kleitman and D. B. West, “Spanning trees with many leaves,” SIAM J. Discrete Math., 4, 99–106 (1991).MathSciNetCrossRefGoogle Scholar
  3. 3.
    N. Alon, “Transversal numbers of uniform hypergraphs,” Graphs Combin., 6, 1–4 (1990).MathSciNetCrossRefGoogle Scholar
  4. 4.
    D. V. Karpov, “Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4,” Zap. Nauchn. Semin. POMI, 406, 67–94 (2012).Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.St. Peterburg State UniversitySt. PeterburgRussia

Personalised recommendations