Spectra of the neighbourhood corona of two graphs

TL;DR

This paper derives the spectral properties of the neighbourhood corona of two graphs, providing formulas for adjacency, Laplacian, and signless Laplacian spectra, and uses these results to construct cospectral and expander graph families.

Contribution

It offers explicit spectral formulas for the neighbourhood corona of graphs, extending spectral graph theory and enabling new graph constructions.

Findings

Derived adjacency spectrum for arbitrary graphs

Established Laplacian and signless Laplacian spectra for regular graphs

Constructed new cospectral and expander graph families

Abstract

Given simple graphs $G_1$ and $G_2$, the neighbourhood corona of $G_1$ and $G_2$, denoted $G_1\star G_2$, is the graph obtained by taking one copy of $G_1$ and $|V(G_1)|$ copies of $G_2$, and joining the neighbours of the $i$th vertex of $G_1$ to every vertex in the $i$th copy of $G_2$. In this paper we determine the adjacency spectrum of $G_1 \star G_2$ for arbitrary $G_1$ and $G_2$, and the Laplacian spectrum and signless Laplacian spectrum of $G_1\star G_2$ for regular $G_1$ and arbitrary $G_2$, in terms of the corresponding spectrum of $G_1$ and $G_2$. 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.