Abstract
For two simple connected graphs G1 and G2, we introduce a new graph op- eration called the total corona G1⊛G2 on G1 and G2 involving the total graph of G1. Subsequently, the adjacency (respectively, Laplacian and signless Laplacian) spectra of G1⊛G2 are determined in terms of these of a regular graph G1 and an arbitrary graph G2. As applications, we construct infinitely many pairs of adjacency (respec- tively, Laplacian and signless Laplacian) cospectral graphs. Besides we also compute the number of spanning trees of G1⊛G2. AMS subject classifications: 05C50, 05C90
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.
