IAD Index of Academic Documents
  • Home Page
  • About
    • About Izmir Academy Association
    • About IAD Index
    • IAD Team
    • IAD Logos and Links
    • Policies
    • Contact
  • Submit A Journal
  • Submit A Conference
  • Submit Paper/Book
    • Submit a Preprint
    • Submit a Book
  • Contact
  • Turkish Journal of Mathematics and Computer Science
  • Volume:11 Special Issue
  • Improved Bounds For The Number of Spanning Trees of Graphs

Improved Bounds For The Number of Spanning Trees of Graphs

Authors : Ezgi KAYA, Ayşe Dilek MADEN
Pages : 31-39
View : 11 | Download : 11
Publication Date : 2019-12-30
Article Type : Conference Paper
Abstract :For a given a simple connected graph, we present some new bounds via a new approach for the number of spanning trees. Usage this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.
Keywords : Spanning trees, normalized Laplacian eigenvalues degree, Kirchhoff index, Randi\` c index

ORIGINAL ARTICLE URL
VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.


Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025