Turkish Journal of Mathematics and Computer Science
Improved Bounds For The Number of Spanning Trees of Graphs
Yazarlar: Ezgi KAYA, Ayşe Dilek MADEN
Cilt 11 , Sayı - , 2019 , Sayfalar 31 - 39
Konular:Matematik
Anahtar Kelimeler:Spanning trees,Normalized Laplacian eigenvalues,(degree) Kirchhoff index,Randi\'{c} index
Özet: 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.
ATIFLAR
Atıf Yapan Eserler
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2019, title={Improved Bounds For The Number of Spanning Trees of Graphs}, volume={11}, publisher={Turkish Journal of Mathematics and Computer Science}, author={Ezgi KAYA,Ayşe Dilek MADEN}, year={2019}, pages={31–39} }
APA
KOPYALA
Ezgi KAYA,Ayşe Dilek MADEN. (2019). Improved Bounds For The Number of Spanning Trees of Graphs (Vol. 11, pp. 31–39). Vol. 11, pp. 31–39. Turkish Journal of Mathematics and Computer Science.
MLA
KOPYALA
Ezgi KAYA,Ayşe Dilek MADEN. Improved Bounds For The Number of Spanning Trees of Graphs. Turkish Journal of Mathematics and Computer Science, 2019, pp. 31–39.