Enumeration of spanning trees in certain vertex corona product graph

The corona product of two graphs Gn1 and Gn2 is one of the most important graph operations that allows us to build a complex graph by means of simple graphs. In this paper, firstly we will define the corona product and other necessary notions. Next, we will give the explicit major formula which counts the number of spanning trees in corona product graph of two planar graphs. Then, we will propose the corona product of a planar graph and certain families of outerplanar graphs such as the Fan graph, the Star and the complete binary tree, for which we will calculate the number of spanning trees. Mathematics Subject Classification: 05C85, 05C30