Counting the number of spanning trees of graphs

Document Type: Research Paper

Authors

1 Shahid Rajaee Teacher Training University,I. R. Iran

2 Shahid Rajaee Teacher Training University, I. R. Iran

Abstract

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.

Keywords