The Weisfeiler-Lehman Isomorphism Test
Two graphs are considered isomorphic if there is a mapping between the nodes of the graphs that preserves node adjacencies. Here is the algorithm for the Weisfeiler-Lehman Isomorphism Test. It produces for each graph a canonical form. If the canonical forms of two graphs are not equivalent, then the graphs are definitively not isomorphic. However, it is possible for two non-isomorphic graphs to share a canonical form, so this test alone cannot provide conclusive evidence that two graphs are isomorphic.
Edit details Edit relations Attach new author Attach new topic Attach new resource