The number of spanning trees in corona edge product of tree and S-linear chain map

Abstract

The number of spanning trees in a graph G is a significant topological invariant of networks. The must known method to compute this number is the Matrix theorem. But this algorithm can not be used in the practical areas, because of its exponential complexity(Θ(n3)), namely for large graphs. that why there is so much interest in obtaining explicit expressions for some graph families. In this paper, we used an efficient method to provide an explicit formulas calculating the number of spanning trees in the corona edge product graph of a tree and S-linear chain.