Counting of spanning trees in the corona edge product network

The problem of counting the spanning trees is related to various interesting problems. The number of spanning trees is applied in several practical areas. But computing the number of spanning trees in general networks using standard algorithms (Matrix tree theorem is the first method) is computationally arduous. In this paper, we aim to compute the number of spanning trees in the corona edge product, investigating an effective combinatorial method, providing analytic formulas for this product graph of some classes graphs.