Spectra of Coronae

Abstract

We introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of the corona $G\circ H$ of two graphs $G$ and $H$. In particular, we show that this spectrum is completely determined by the spectra of $G$ and $H$ and the coronal of $H$. Previous work has computed the spectrum of a corona only in the case that $H$ is regular. We then explicitly compute the coronals for several families of graphs, including regular graphs, complete $n$-partite graphs, and paths. Finally, we use the corona construction to generate many infinite families of pairs of cospectral graphs.

9 pages

Cited by in corpus (18)

• Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
• Spectra of eccentricity matrices of graphs
• Spectra of the neighbourhood corona of two graphs
• Spectra of subdivision-vertex join and subdivision-edge join of two graphs
• On Spectrum of Neighbourhood Corona Product of Signed Graphs
• The Q-generating function for graphs with application
• On Laplacian and Distance Laplacian Spectra of Generalized Fan Graph & a New Graph Class
• A generalization of Fiedler's lemma and the spectra of H-join of graphs
• Extended corona product as an exactly tractable model for weighted heterogeneous networks
• Spectra of generalized corona of graphs constrained by vertex subsets
• Normalized Laplacian spectra of central vertex join and central edge join of graphs
• The normalized Laplacian spectra of subdivision vertex-edge neighbourhood vertex(edge)-corona for graphs
• Spectra of $(H_1,H_2)$-merged subdivision graph of a graph
• Coronae graphs and their $\alpha$-eigenvalues
• The spectra and the signless Laplacian spectra of graphs with pockets
• The normalized Laplacians and random walks of the parallel subdivision graphs
• Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach
• Spectra of new graph operations based on central graph