Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 294038, 5 pages
http://dx.doi.org/10.1155/2014/294038
Research Article

On the Number of Spanning Trees of Graphs

Department of Mathematics, Science Faculty, Selçuk University, Alaeddin Keykubat Campus, 42075 Konya, Turkey

Received 29 August 2013; Accepted 24 December 2013; Published 10 February 2014

Academic Editors: C. D. Fonseca and A. Jaballah

Copyright © 2014 Ş. Burcu Bozkurt and Durmuş Bozkurt. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. Gutman and K. Ch. Das, “The first Zagreb index 30 years after,” MATCH Communications in Mathematical and in Computer Chemistry, no. 50, pp. 83–92, 2004. View at Google Scholar
  2. B. Bollobás and P. Erdös, “Graphs of extremal weights,” Ars Combinatoria, vol. 50, pp. 225–233, 1998. View at Google Scholar
  3. M. Cavers, S. Fallat, and S. Kirkland, “On the normalized Laplacian energy and general Randić index R-1 of graphs,” Linear Algebra and Its Applications, vol. 433, no. 1, pp. 172–190, 2010. View at Publisher · View at Google Scholar
  4. G. Yu and L. Feng, “Randić index and eigenvalues of graphs,” Rocky Mountain Journal of Mathematics, vol. 40, no. 2, pp. 713–721, 2010. View at Publisher · View at Google Scholar
  5. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs, vol. 87 of Pure and Applied Mathematics, Academic Press, New York, NY, USA, 1980.
  6. F. R. K. Chung, Spectral Graph Theory, CBMS Lecture Notes, AMS, Providence, RI, USA, 1997.
  7. M. Fiedler, “Algebraic connectivity of graphs,” Czechoslovak Mathematical Journal, vol. 23, no. 98, pp. 298–305, 1973. View at Google Scholar
  8. K. Ch. Das, A. D. Güngör, and Ş. B. Bozkurt, “On the normalized Laplacian eigenvalues of graphs,” Ars Combinatoria. In press.
  9. R. Merris, “Laplacian matrices of graphs: a survey,” Linear Algebra and Its Applications, vol. 197-198, pp. 143–176, 1994. View at Publisher · View at Google Scholar
  10. R. Merris, “A survey of graph Laplacians,” Linear and Multilinear Algebra, vol. 39, no. 1-2, pp. 19–31, 1995. View at Publisher · View at Google Scholar
  11. G. R. Grimmett, “An upper bound for the number of spanning trees of a graph,” Discrete Mathematics, vol. 16, no. 4, pp. 323–324, 1976. View at Publisher · View at Google Scholar
  12. R. Grone and R. Merris, “A bound for the complexity of a simple graph,” Discrete Mathematics, vol. 69, no. 1, pp. 97–99, 1988. View at Publisher · View at Google Scholar
  13. E. Nosal, Eigenvalues of graphs [M.S. thesis], University of Calgary, 1970.
  14. K. Ch. Das, “A sharp upper bound for the number of spanning trees of a graph,” Graphs and Combinatorics, vol. 23, no. 6, pp. 625–632, 2007. View at Publisher · View at Google Scholar
  15. X.-D. Zhang, “A new bound for the complexity of a graph,” Utilitas Mathematica, vol. 67, pp. 201–203, 2005. View at Google Scholar
  16. L. Feng, G. Yu, Z. Jiang, and L. Ren, “Sharp upper bounds for the number of spanning trees of a graph,” Applicable Analysis and Discrete Mathematics, vol. 2, no. 2, pp. 255–259, 2008. View at Publisher · View at Google Scholar
  17. J. Li, W. C. Shiu, and A. Chang, “The number of spanning trees of a graph,” Applied Mathematics Letters, vol. 23, no. 3, pp. 286–290, 2010. View at Publisher · View at Google Scholar
  18. Ş. B. Bozkurt, “Upper bounds for the number of spanning trees of graphs,” Journal of Inequalities and Applications, vol. 2012, article 269, 7 pages, 2012. View at Publisher · View at Google Scholar
  19. K. Ch. Das, A. S. Cevik, and I. N. Cangul, “The number of spanning trees of a graph,” Journal of Inequalities and Applications, vol. 2013, article 395, 13 pages, 2013. View at Publisher · View at Google Scholar
  20. H. Kober, “On the arithmetic and geometric means and on Hölder's inequality,” Proceedings of the American Mathematical Society, vol. 9, pp. 452–459, 1958. View at Google Scholar
  21. P. Zumstein, Comparison of spectral methods through the adjacency matrix and the Laplacian of a graph [Diploma thesis], ETH Zürich, 2005.
  22. D. Cvetković, P. Rowlinson, and S. K. Simić, “Signless Laplacians of finite graphs,” Linear Algebra and Its Applications, vol. 423, no. 1, pp. 155–171, 2007. View at Publisher · View at Google Scholar
  23. Y. Chen and L. Wang, “Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph,” Linear Algebra and Its Applications, vol. 433, no. 5, pp. 908–913, 2010. View at Publisher · View at Google Scholar
  24. Y. Zhang, X. Liu, B. Zhang, and X. Yong, “The lollipop graph is determined by its Q-spectrum,” Discrete Mathematics, vol. 309, no. 10, pp. 3364–3369, 2009. View at Publisher · View at Google Scholar