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?
Revision history [back]
 | 1 | initial version |
Connected non-bipartite graphs with a unique perfect matching having highest value of determinant
Connected non-bipartite graphs with a unique perfect matching having highest value of determinant
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?
