|
|
SHARP UPPER BOUNDS FOR THE NUMBER OF SPANNING TREES OF A GRAPHDOI: 10.2298/aadm0802255f Keywords: Graph , spanning trees , Laplacian eigenvalues Abstract: This note presents two new upper bounds for the number of spanning trees of a graph in terms of the order, edge number and maximum degree of a graph.
|
