On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

Abstract

The k-dimensional Weisfeiler-Leman algorithm ((formula presented)) is a fruitful approach to the Graph Isomorphism problem. (formula presented) corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. (formula presented) is the classical color refinement routine. Indistinguishability by (formula presented) is an equivalence relation on graphs that is of fundamental importance for isomorphism testing, descriptive complexity theory, and graph similarity testing which is also of some relevance in artificial intelligence. Focusing on dimensions k=1,2, we investigate subgraph patterns whose counts are (formula presented) invariant, and whose occurrence is (formula presented) invariant. We achieve a complete description of all such patterns for dimension k=1 and considerably extend the previous results known for k=2.