networkx.algorithms.isomorphism.could_be_isomorphic

could_be_isomorphic(G1, G2)[source]

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

Parameters

G1, G2 (graphs) – The two graphs G1 and G2 must be the same type.

Notes

Checks for matching degree, triangle, and number of cliques sequences.