English

New constructions of non-regular cospectral graphs

Combinatorics 2023-08-16 v1

Abstract

We consider two types of joins of graphs G1G_{1} and G2G_{2}, G1G2G_{1}\veebar G_{2} - the Neighbors Splitting Join and G1=G2G_{1}\underset{=}{\lor}G_{2} - 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 G1G_{1} and G2G_{2} are regular, we compute the adjacency spectrum, the Laplacian spectrum, the signless Laplacian spectrum of G1=G2G_{1}\underset{=}{\lor}G_{2} and the normalized Laplacian spectrum of G1G2G_{1}\veebar G_{2} and G1=G2G_{1}\underset{=}{\lor}G_{2}. 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.

Keywords

Cite

@article{arxiv.2308.07724,
  title  = {New constructions of non-regular cospectral graphs},
  author = {Suliman Hamud and Abraham Berman},
  journal= {arXiv preprint arXiv:2308.07724},
  year   = {2023}
}
R2 v1 2026-06-28T11:55:59.855Z