Revision history [back]

for g in graphs.nauty_geng('8 -c'):
                    if g.size()==10:
                       A=g.adjacency_matrix()
                       k=A.determinant()
                       show(k)
                       g.show()

Here I am trying to obtain those graph(s) which have exactly one perfect matching and among all those graphs I need to obtain only that graph(s) whose adjacency matrix have highest determinant.