Improved bounds for the number of spanning trees of graphs

For a given a simple connected graph, we present some new bounds via a new approach for the numberof spanning trees. Usage this approach presents an advantage not only to derive old and new bounds on this topicbut also gives an idea how some previous results in similar area can be developed.

PDF

___

[1] Banchev, D., Balaban, A.T., Liu, X., Klein, D.J., Molecular cyclicity and centricity of polycyclic graphs. I. Cyclicity based on resistance distances or reciprocal distances, Int. J. Quantum Chem., 50(1994), 2978–2981.
[2] Biler, P., Witkowski, A., Problems in Mathematical Analysis, New York, 1990.
[3] Bollobas, B., Erdos, P., ¨ Graphs of extremal weights, Ars Combinatoria, 50(1998), 225–233.
[4] Bozkurt, S¸.B., Bozkurt, D., On the sum of powers of normalized Laplacian eigenvalues of graphs, MATCH Commun. Math. Comput. Chem., 68(2012), 917–930.
[5] Bozkurt, S¸. B., Bozkurt, D., On the number of spanning trees of graphs,The Scientific Worl Journal, 2014(2014), Article ID 294038, 5 pages.
[6] Covers, M., Fallat, S., Kirkland, S., On the normalized Laplacian energy and the general Randic index of graphs, Linear Algebra and its Appl., 433(2010), 172–190.
[7] Chen, H., Zhang, F., Resistance distance and the normalized Laplacian spectrum, Discrete App. Math., 155(2007), 654–661.
[8] Chung, F.R.K., Spectral Graph Theory, CBMS Lecture Notes, Providence, 1997.
[9] Cvetkovi´c, D., Doob, M., Sachs, H., Spectra of Graphs, Academic Press, New York, 1980.
[10] Das, K.Ch., Maden, A.D., Bozkurt, S¸. B., On the normalized Laplacian eigenvalues of graphs, Ars Combinatoria, in press.
[11] Das, K.Ch., A sharp upper bound for the number of spanning trees of a graph, Graphs and Combinatorics, 23(2007), 625–632.
[12] Das, K.Ch., C¸ evik, A.S., Cangul, I. N., ¨ The number of spanning trees of a graph, Journal of Inequalities and Applications 2013, 395(2013), 13 pages.
[13] Feng, L., Yu, G., Jiang, Z., Ren, L., Sharp upper bounds for the number of spanning trees of a graph, Applicable Analysis and Discrete Mathematics, 2(2008), 255–259.
[14] Grone R., Merris, R., A bound for the complexity for a simple graph, Discrete Mathematics, 69(1988), 97–99.
[15] Gutman, I., Mohar, B., The quasi-Wiener and the Kirchhoff indices Coincide, J. Chem. Inf. Comput. Sci., 36(1996), 982–985.
[16] Klein, D.J., Randi´c, M., Resistance distance. Applied graph theory and discrete mathematics in chemistry (Saskatoon, SK, 1991), J. Math. Chem., 12(1993), 81–95.
[17] Li, J., Shiu, W. C., Chang, A., The number of spanning trees of a graph, Applied Mathematics Letters, 23(2010), 286–290.
[18] Merris, R., Laplacian matrices of graphs. A Survey, Linear Algebra and its Appl., 197(1994), 143–176.
[19] Merris, R., A survey of graph Laplacians, Linear and Multilinear Algebra, 39(1995), 19–31.
[20] Palacios, J., Renom, J.M., Another look at the degree Kirchhoff index, Int. J. Quantum Chem., 111(2011), 3453–3455.
[21] Yang, Y.J., Jiang, X.Y.,Unicyclic graphs with extremal Kirchhoff index, MATCH Commun. Math. Comput. Chem., 60(2008), 107–120.
[22] Yu, G., Feng, L., Randi´c index and eigenvalues of graphs, Rocky Mount. J. Math., 40(2010), 713–721.
[23] Zhang, W., Deng, H., The second maximal and minimal Kirchhoff indices of unicyclic graphs, MATCH Commun. Math. Comput. Chem., 61(2009), 683–695.
[24] Zhang, X.D., A new bound for the complexity of a graph, Utilitas Mathematica, 67(2005), 201–203.
[25] Zhou, B., On sum of powers of the Laplacian eigenvalues of graphs , Linear Algebra and its Appl., 429(2008), 2239–2246.
[26] Zhou, B., Trinajistic, N., The Kirchhoff index and the matching number, Int. J. Quantum Chem., 109(2009), 2978–2981.