for g in graphs.nauty_geng('7 -c'): if g.size()==9: A=g.adjacency_matrix() k=A.determinant() show(k) g.show()
Here I am trying to obtain those graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.
