Abstract
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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
