For every integer $n\geq 11$, we construct pairs of connected, irregular, nonisomorphic graphs on $n$ vertices that are cospectral for the adjacency, Laplacian, signless Laplacian, and normalized Laplacian matrices, have equal independence, clique, chromatic, complement chromatic, and maximum-cut numbers, and have dist...
I. Sason· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.