Research demonstrates infinite pairs of connected cospectral chain graphs, indicating flaws in previous theories.
Two non isomorphic graphs G and H are said to be cospectral, if they share the same adjacency eigenvalues. In this paper, we use a recursive procedure for computing the characteristic polynomial of chain graphs in order to obtain infinitely many pairs of connected cospectral chain graphs. This result disproves a conjecture posed in [Czechoslovak Math. J. 70 (4) (2020), 1125-1138]. In addition we construct infinite families of bipartite graphs sharing the same spectrum.
No takes yet. Share an insight, caveat, or question.
Anđelić et al. (2025) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: