Advertisement

Journal of Mathematical Sciences

, Volume 196, Issue 6, pp 768–783 | Cite as

Spanning Trees With Many Leaves: Lower Bounds in Terms of the Number of Vertices of Degree 1, 3 and at Least 4

  • D. V. Karpov
Article
  • 32 Downloads

Is it proves that every connected graph with s vertices of degree 1 and 3 anf t vertices of degree at least 4 has a spanning tree with at least \( \frac{1}{3}t + \frac{1}{4}s + \frac{3}{2} \) leaves. Infinite series of grpahs showing that our bound is tight are given.

Keywords

Lower Bound Span Tree Connected Graph Infinite Series 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. A. Storer, “Constructing full spanning trees for cubic graphs,” Inform. Process. Lett., 13, 8-11 (1981).CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    D. J. Kleitmean and D. B. West, “Spanning trees with many leaves,” SIAM J. Discrete Math., 4, 99-106 (1991).CrossRefMathSciNetGoogle Scholar
  3. 3.
    J. R. Griggs and M. Wu, “Spanning trees in graphs of minimum degree 4 or 5,” Discrete Math., 104, 167-183 (1992).Google Scholar
  4. 4.
    N. Alon,”Transversal numbers of uniform hypergraph,” Graphs Combinatorics, 6, 1-4 (1990).CrossRefMATHGoogle Scholar
  5. 5.
    G. Ding, T. Johnson, and P. Seymour, “Spanning trees woth many leaves,” J. Graph. Theory, 37, 189-197 (2001).CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Y. Caro, D. B. West, and R. Yuster, “Connected Domination and spanning trees with many leaves,” SIAM J. Discrete Math., 13, 202-211 (2000).CrossRefMathSciNetGoogle Scholar
  7. 7.
    P. S. Bonsma, “Spanning trees with many leaves in graphs with minimum degree three,” SIAM J. Discrete Math. 22, 920-937 (2008).CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    P. S. Bonsma and F. Zickfield, “Spanning trees with many leaves in graphs without diamonds and blossoms.” In: LATIN 2008: Theoretical Informatics, 4957, Springer, Berlin (2008), pp. 531-543.Google Scholar
  9. 9.
    N. V. Gravin, “Constructing spanning tree with many leaves,” Zap. Nauchn. Semin. POMI, 381, 31-46 (2010).Google Scholar
  10. 10.
    D. V. Karpov, “Spanning trees with many leaves,” Zap. Nauchn. Semin. POMI, 381, 78-87 (2010).Google Scholar
  11. 11.
    A. V. Bankevich and D. V. Karpov, “Bounds of the number leaves of spanning trees,” Zap. Nauchn. Semin. POMI, 391, 18-34 (2011).Google Scholar
  12. 12.
    A. V. Bankevich, “Bounds of the number of leaves of spanning trees in graphs without triangles,” Zap. Nauchn. Semin. POMI, 391, 5-17 (2011).Google Scholar
  13. 13.
    D. V. Karpov, “Spanning trees with many leaves: new lower bound in terms of number of vertices of degree 3 and least 4,” Zap. Nauchn. Semin. POMI, 406 , 31-66 (2012)MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.St. Petersburg Department of the Steklov Mathematical InstituteSt. PetersburgRussia

Personalised recommendations