A graph isomorphism invariant based on neighborhood aggregation

Alpár Jüttner, Péter Madarasi

This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism prob…