New constructions of non-regular cospectral graphs
Abstract
We consider two types of joins of graphs G1 and G2, G1 G2 - the Neighbors Splitting Join and G1=G2 - the Non Neighbors Splitting Join, and compute the adjacency characteristic polynomial, the Laplacian characteristic polynomial and the signless Laplacian characteristic polynomial of these joins. When G1 and G2 are regular, we compute the adjacency spectrum, the Laplacian spectrum, the signless Laplacian spectrum of G1=G2 and the normalized Laplacian spectrum of G1 G2 and G1=G2. We use these results to construct non regular, non isomorphic graphs that are cospectral with respect to the four matrices: adjacency, Laplacian , signless Laplacian and normalized Laplacian.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.