Construction of non-regular $A_\alpha$-cospectral graphs from some join of graphs
Combinatorics
2024-03-11 v3
Abstract
Cospectral graphs are a fascinating concept in graph theory, where two non-isomorphic graphs possess identical sets of eigenvalues. In this paper, we compute the -characteristic polynomial of neighbour and non-neighbour splitting join, neighbour and non-neighbour shadow join, central vertex and edge join and duplicate join of two graphs. In addition, when and are regular, we compute the -spectrum of these graphs. As an application, we construct non-regular, non-isomorphic graphs that are -cospectral.
Cite
@article{arxiv.2210.06715,
title = {Construction of non-regular $A_\alpha$-cospectral graphs from some join of graphs},
author = {Najiya V K and Chithra A},
journal= {arXiv preprint arXiv:2210.06715},
year = {2024}
}