The Graph Isomorphism problem regained interest with the rise of Graph Neural Networks (GNN). These GNN models have limited ability to distinguish between isomorphic graphs and hence their outputs are ...

This work is a study of the implementation found at nauty package that uses canonical labeling to identify isomorphic graphs. For brute, two lines must be given as input, each line describes a graph.

Iterates over edge counts from ( \max (1, n-1) ) to ( n (n-1) ), creating graphs with ( x ) edges. Checks each graph for weak connectivity using nx.is_weakly_connected. Uses nx.is_isomorphic to ensure ...

The identification and enumeration of small, non-isomorphic graphs, called graphlets, within larger graphs is an analytic tool used for graph analytics. The problem of identifying graphlets embedded ...