Spectra of the neighbourhood corona of two graphs
Abstract
Given simple graphs G1 and G2, the neighbourhood corona of G1 and G2, denoted G1 G2, is the graph obtained by taking one copy of G1 and |V(G1)| copies of G2, and joining the neighbours of the ith vertex of G1 to every vertex in the ith copy of G2. In this paper we determine the adjacency spectrum of G1 G2 for arbitrary G1 and G2, and the Laplacian spectrum and signless Laplacian spectrum of G1 G2 for regular G1 and arbitrary G2, in terms of the corresponding spectrum of G1 and G2. The results on the adjacency and signless Laplacian spectra enable us to construct new pairs of adjacency cospectral and signless Laplacian cospectral graphs. As applications of the results on the Laplacian spectra, we give constructions of new families of expander graphs from known ones by using neighbourhood coronae.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.