首页|The smallest pair of cospectral cubic graphs with different chromatic indexes
The smallest pair of cospectral cubic graphs with different chromatic indexes
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
NSTL
Elsevier
? 2021 Elsevier B.V.Using an exhaustive search on cubic graphs of order 16, we find a unique cospectral pair with different chromatic indexes. This example indicates that the chromatic index of a regular graph is not characterized by its spectrum, which answers a question recently posed in Etesami and Haemers (2020). We prove that any orthogonal matrix representing the similarity between the two adjacency matrices of the cospectral pair cannot be rational. This implies that the cospectral pair cannot be obtained using the original GM-switching method or its generalizations based on rational orthogonal matrices.