%0 Journal Article
%T Counting the number of spanning trees of graphs
%J Iranian Journal of Mathematical Chemistry
%I University of Kashan
%Z 2228-6489
%A GHORBANI, M.
%A BANI-ASADI, E.
%D 2013
%\ 03/01/2013
%V 4
%N 1
%P 111-121
%! Counting the number of spanning trees of graphs
%K Spanning tree
%K Laplacian eigenvalue
%K Fullerene
%R 10.22052/ijmc.2013.5285
%X A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
%U http://ijmc.kashanu.ac.ir/article_5285_483560b3d82294a58ea6be649a695b0d.pdf