A New Upper Bound on the Number of Spanning Trees of a Graph

作者：Li Rao^*

来源：Utilitas Mathematica, 2013, 91: 339-343.

• Spanning Tree
• Normalized Laplacian Eigenvalue

A new upper bound involving the (-1)-Randic index for the number of spanning trees of a graph is presented in this note.

• 出版日期2013-7