Revision history [back]

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.

for g in graphs.nauty_geng('7 graphs.nauty_geng(' -c'): if g.size()==9: g.size()==10: 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.

for g in graphs.nauty_geng(' 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 graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.

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 graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.

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 graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.

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 graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.

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 graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.

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 graphs which have a unique perfect matching, that is, those graphs which have exactly one perfect matching.

.

for g in graphs.nauty_geng('8 -c'):
                    if g.size()==10:
                       A=g.adjacency_matrix()
                       k=A.determinant()
                       show(k)
                       g.show()
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.