Corona Product Complexity of Planar Graph and S-chain Graph

Since its appearance, the number of spanning trees of a graph has been among the most important problems in graph theory. We aimed to get explicit formula counting this number in the corona product graph of two planar graphs. In this paper, we study the corona product of a planar graph with a linear chain and cycle chain, for which we calculate their number of spanning trees. Our research findings highlight the potential of combinatorial method, which allowed us to count this number for a large graph as corona product graph.