Local WL invariance and hidden shades of regularity
From MaRDI portal
Publication:2235273
DOI10.1016/j.dam.2021.08.037zbMath1475.05177arXiv2002.04590OpenAlexW3202051463MaRDI QIDQ2235273
Johannes Köbler, Frank Fuhlbrück, Oleg Verbitsky
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.04590
strongly regular graphsdistance-regular graphsWeisfeiler-Leman algorithmconstituent graphs of association schemessubgraph and homomorphism counts
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equiarboreal graphs
- An optimal lower bound on the number of variables for graph identification
- A partial k-arboretum of graphs with bounded treewidth
- The matching polynomial of a regular graph
- Codes from incidence matrices of graphs
- On the cancellation law among finite relational structures
- Finite permutation groups of rank 3
- On recognizing graphs by numbers of homomorphisms
- On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
- Contractors and connectors of graph algebras
- Homomorphisms are a good basis for counting small subgraphs
- On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
- Theory of Association Schemes
- Graph isomorphism in quasipolynomial time [extended abstract]
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- The Weisfeiler-Leman algorithm and recognition of graph properties
This page was built for publication: Local WL invariance and hidden shades of regularity
