Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. R. Griggs and M. Wu, “Spanning trees in graphs of minimum degree 4 or 5,” Discrete Math., 104, 167–183 (1992).

    Article  MathSciNet  Google Scholar 

  2. D. J. Kleitman and D. B. West, “Spanning trees with many leaves,” SIAM J. Discrete Math., 4, 99–106 (1991).

    Article  MathSciNet  Google Scholar 

  3. N. Alon, “Transversal numbers of uniform hypergraphs,” Graphs Combin., 6, 1–4 (1990).

    Article  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. St. Peterburg State University, St. Peterburg, Russia

    E. N. Simarova

Authors
  1. E. N. Simarova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. N. Simarova.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 464, 2017, pp. 112–131.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Simarova, E.N. A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6. J Math Sci 236, 542–553 (2019). https://doi.org/10.1007/s10958-018-4132-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-018-4132-2

Search

Navigation