Suppose we consider the class of connected non-bipartite graphs with a unique perfect matching with 10 vertices and 12 edges. Now from this collection, how one can obtain the graph(s) whose adjacency matrix has highest absolute value of its determinant?
The following code tells that the max absolute value of determinant is 9 and there are 4 such graphs achieving it:
maxdet = 0
res = []
for G in graphs.nauty_geng('-c 10 12'):
if G.is_bipartite() or abs(G.matching_polynomial()[0])!=1:
continue
d = abs(G.adjacency_matrix().det())
if d>maxdet:
res = []
maxdet = d
if d==maxdet:
res.append(G)
print('Max:',maxdet)
print('#graphs:', len(res))Thank you..
Can you please help me in displaying those graphs, maximizing the determinant?
Add something along these lines:
for G in res:
G.show()You can see them at Sagecell: https://sagecell.sagemath.org/?q=czfqjg
ok.But I need those graphs having a unique perfect matching.. see the question
They do have a unique perfect matching. In my code this is controlled by the requirement for G.matching_polynomial()[0] to be equal -1.
Asked: 0 years ago
Seen: 527 times
Last updated: May 23 '24
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
