Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
arXiv:1212.0851 · doi:10.1016/j.laa.2012.12.033
Abstract
Let be a graph with vertex set and edge set . The subdivision graph of a graph is the graph obtained by inserting a new vertex into every edge of . Let and be two vertex disjoint graphs. The subdivision-vertex neighbourhood corona of and , denoted by , is the graph obtained from and copies of , all vertex disjoint, and joining the neighbours of the th vertex of to every vertex in the th copy of . The subdivision-edge neighbourhood corona of and , denoted by , is the graph obtained from and copies of , all vertex disjoint, and joining the neighbours of the th vertex of to every vertex in the th copy of , where is the set of inserted vertices of . In this paper we determine the adjacency spectra, the Laplacian spectra and the signless Laplacian spectra of (respectively, ) in terms of the corresponding spectra of and . As applications, these results enable us to construct infinitely many pairs of cospectral graphs, and using the results on the Laplacian spectra of subdivision-vertex neighbourhood coronae, new families of expander graphs are constructed from known ones.
arXiv admin note: substantial text overlap with arXiv:1209.5906, arXiv:1212.0619
References in corpus (2)
Cited by in corpus (7)
- Spectra of subdivision-vertex join and subdivision-edge join of two graphs
- The Q-generating function for graphs with application
- On Laplacian and Distance Laplacian Spectra of Generalized Fan Graph & a New Graph Class
- Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach
- Determining the b-chromatic number of subdivision-vertex neighbourhood coronas
- Spectra of new graph operations based on central graph
- The normalized Laplacians and random walks of the parallel subdivision graphs