Descriptive complexity of graph spectra

DOI10.1016/J.APAL.2019.04.005MaRDI QIDQ6828198zbMATH OpenFDO

Authors Anuj Dawar, Simone Severini, Octavio Zapata

Publication date 18 September 2019

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APAL.2019.04.005

zbMATH Keywords

counting logicsdescriptive complexityfinite model theoryisomorphism problemsspectral graph theorystrongly regular graphs

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30) Descriptive complexity and finite models (68Q19)

This page was built for publication: Descriptive complexity of graph spectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828198)