加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本