Descriptive complexity of graph spectra.
Annals of Pure and Applied Logic
MetadataShow full item record
Dawar, A., Severini, S., & Zapata, O. (2019). Descriptive complexity of graph spectra.. Annals of Pure and Applied Logic, 170 (9), 993-1007. https://doi.org/10.1016/j.apal.2019.04.005
Two graphs are cospectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are cospectral with it are isomorphic to it. We consider these properties in relation to logical definability. We show that any pair of graphs that are elementarily equivalent with respect to the three-variable counting first-order logic are cospectral, and this is not the case with , nor with any number of variables if we exclude counting quantifiers. We also show that the class of graphs that are determined by their spectra is definable in partial fixed-point logic with counting. We relate these properties to other algebraic and combinatorial problems.
OZ was supported by CONACyT-Mexico Grant 384665, SS was supported by EPSRC and The Royal Society.
External DOI: https://doi.org/10.1016/j.apal.2019.04.005
This record's URL: https://www.repository.cam.ac.uk/handle/1810/300515
All rights reserved