could_be_isomorphic(G1, G2)[source]#

Returns False if graphs are definitely not isomorphic. True does NOT guarantee isomorphism.

G1, G2graphs

The two graphs G1 and G2 must be the same type.


Checks for matching degree, triangle, and number of cliques sequences. The triangle sequence contains the number of triangles each node is part of. The clique sequence contains for each node the number of maximal cliques involving that node.