Connection Matrices and the Definability of Graph Parameters

DOI10.2168/LMCS-10(4:1)2014zbMath1345.03054arXiv1308.3654OpenAlexW1662963207MaRDI QIDQ2929592

Johann A. Makowsky, Tomer Kotek

Publication date: 13 November 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.3654

zbMATH Keywords

graph invariantsfinite model theory

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13)

Related Items (7)

Harary polynomials ⋮ Logics of Finite Hankel Rank ⋮ Recognizable series on graphs and hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the complexity of generalized chromatic polynomials ⋮ A logician's view of graph polynomials

This page was built for publication: Connection Matrices and the Definability of Graph Parameters