TY - JOUR
ID - 5285
TI - Counting the number of spanning trees of graphs
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - GHORBANI, M.
AU - BANI-ASADI, E.
AD - Shahid Rajaee Teacher Training
University,I. R. Iran
AD - Shahid Rajaee Teacher Training
University, I. R. Iran
Y1 - 2013
PY - 2013
VL - 4
IS - 1
SP - 111
EP - 121
KW - Spanning tree
KW - Laplacian eigenvalue
KW - Fullerene
DO - 10.22052/ijmc.2013.5285
N2 - 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.
UR - http://ijmc.kashanu.ac.ir/article_5285.html
L1 - http://ijmc.kashanu.ac.ir/article_5285_483560b3d82294a58ea6be649a695b0d.pdf
ER -