University of KashanIranian Journal of Mathematical Chemistry2228-64894120130301Counting the number of spanning trees of graphs111121528510.22052/ijmc.2013.5285ENM.GHORBANIShahid Rajaee Teacher Training
University,I. R. IranE.BANI-ASADIShahid Rajaee Teacher Training
University, I. R. IranJournal Article20140504A 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.http://ijmc.kashanu.ac.ir/article_5285_483560b3d82294a58ea6be649a695b0d.pdf