Pebble games and cospectral graphs

DOI10.1016/j.endm.2017.06.055zbMath1378.05130OpenAlexW2742877814MaRDI QIDQ1689933

Simone Severini, Anuj Dawar, Octavio Zapata

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.055

zbMATH Keywords

combinatorial gamesgraph spectraisomorphism approximations

Mathematics Subject Classification ID

Games involving graphs (91A43) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

On the Weisfeiler-Leman dimension of fractional packing ⋮ On Weisfeiler-Leman invariance: subgraph counts and related graph properties

Cites Work

• Infinitary logics and 0-1 laws
• Which graphs are determined by their spectrum?
• Logical hierarchies in PTIME
• Descriptive complexity of graph spectra
• Unnamed Item

This page was built for publication: Pebble games and cospectral graphs