Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
Xiaogang Liu, Pengli Lu

TL;DR
This paper derives spectral properties of subdivision-vertex and subdivision-edge neighbourhood coronae graphs, enabling the construction of cospectral and expander graphs based on the spectra of original graphs.
Contribution
It provides explicit formulas for the adjacency, Laplacian, and signless Laplacian spectra of these coronae graphs in terms of the spectra of the original graphs, a novel spectral analysis approach.
Findings
Spectra of subdivision-vertex neighbourhood coronae are explicitly determined.
Spectra of subdivision-edge neighbourhood coronae are explicitly determined.
New families of cospectral and expander graphs are constructed from these results.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
