This method returns the sublist of L giving all non-isomorphic graphs with selection based on which comes first in L. The format of the graph is retained.
i1 : R = QQ[a..f]; |
i2 : G = {"EhEG", cycle R, completeGraph R, graph {a*d, d*b, b*e, e*c, c*f, f*a}}; |
i3 : removeIsomorphs G o3 = {EhEG, Graph{edges => {{a, b}, {a, c}, {a, d}, {a, e}, {a, f}, {b, c}, ring => R vertices => {a, b, c, d, e, f} ------------------------------------------------------------------------ {b, d}, {b, e}, {b, f}, {c, d}, {c, e}, {c, f}, {d, e}, {d, f}, {e, ------------------------------------------------------------------------ f}}}} o3 : List |