How to find the graph(s) with a perfect matching from the following collection whose adjacency spectral radius is maximum?
for g in graphs.nauty_geng("8 -c"):
if g.size()==9:
A=g.adjacency_matrix().eigenvalues()
A.sort()
g.show()
show(A)
add a comment