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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.