Spectra of the neighbourhood corona of two graphs
arXiv:1209.5906 · doi:10.1080/03081087.2013.816304
Abstract
Given simple graphs and , the neighbourhood corona of and , denoted , is the graph obtained by taking one copy of and copies of , and joining the neighbours of the th vertex of to every vertex in the th copy of . In this paper we determine the adjacency spectrum of for arbitrary and , and the Laplacian spectrum and signless Laplacian spectrum of for regular and arbitrary , in terms of the corresponding spectrum of and . 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.
References in corpus (1)
Cited by in corpus (8)
- Spectra of subdivision-vertex join and subdivision-edge join of two graphs
- Some physical and chemical indices of clique-inserted-lattices
- On Spectrum of Neighbourhood Corona Product of Signed Graphs
- On the -extra connectivity of graphs
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs
- On Laplacian and Distance Laplacian Spectra of Generalized Fan Graph & a New Graph Class
- Coronae graphs and their -eigenvalues
- The normalized Laplacians and random walks of the parallel subdivision graphs