Abstract
The k-dimensional Weisfeiler-Leman algorithm (\(k\text {-}\mathrm {WL}\)) is a fruitful approach to the Graph Isomorphism problem. \(2\text {-}\mathrm {WL}\) corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. \(1\text {-}\mathrm {WL}\) is the classical color refinement routine. Indistinguishability by \(k\text {-}\mathrm {WL}\) 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 \(k\text {-}\mathrm {WL}\) invariant, and whose occurrence is \(k\text {-}\mathrm {WL}\) invariant. We achieve a complete description of all such patterns for dimension \(k=1\) and considerably extend the previous results known for \(k=2\).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
