Edge-Girth as a Structural Edge Feature for Graph Neural Networks
On graph discrimination it is proved a matching limitation: on graphs where every edge sees the same number of shortest cycles of the same length, the descriptor becomes constant and any model built on it collapses back to the 1-WL bound.
Lilian Marey, Charlotte Laclau
· 0 citations