Counting the Number of Spanning Trees of Graphs

GHORBANI, M.; BANI-ASADI, E.

doi:10.22052/ijmc.2013.5285

Counting the Number of Spanning Trees of Graphs

Document Type : Research Paper

Authors

M. GHORBANI ¹

E. BANI-ASADI ²

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

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

10.22052/ijmc.2013.5285

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

Spanning tree

Laplacian eigenvalue

Fullerene