This repository aims at verifying the expressiveness hierarchy proposed in A Complete Expressiveness Hierarchy for Subgraph GNNs via Subgraph Weisfeiler-Lehman Tests.
To achieve this goal, two independent modules are developed:
isoutils.furer
: building generalized Fürer graph from arbitrary base graphisoutils.wl
: support for any isomorphism test within the FWL(2) family
Running python strongly_regular.py
should produce two True
. This script builds 4x4 Rook's graph and Shrikhande graph from definition, and compare them with the generalized Fürer graph constructed from a 4-clique.
To produce results for the paper, run python examples.py
.