Edmonds matrix
In graph theory, the Edmonds matrix of a balanced bipartite graph with sets of vertices and is defined by where the xij are indeterminates. One application of the Edmonds matrix of a bipartite graph is that the graph admits a perfect matching if and only if the polynomial det(Aij) in the xij is not identically zero. Furthermore, the number of perfect matchings is equal to the number of monomials in the polynomial det(A), and is also equal to the permanent of . In addition, rank of is equal to the maximum matching size of .
known for
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Edmonds matrix
In graph theory, the Edmonds matrix of a balanced bipartite graph with sets of vertices and is defined by where the xij are indeterminates. One application of the Edmonds matrix of a bipartite graph is that the graph admits a perfect matching if and only if the polynomial det(Aij) in the xij is not identically zero. Furthermore, the number of perfect matchings is equal to the number of monomials in the polynomial det(A), and is also equal to the permanent of . In addition, rank of is equal to the maximum matching size of .
has abstract
In graph theory, the Edmonds m ...... ation to non-bipartite graphs.
@en
Link from a Wikipage to an external page
Wikipage page ID
11,415,890
page length (characters) of wiki page
Wikipage revision ID
837,319,929
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In graph theory, the Edmonds m ...... the maximum matching size of .
@en
label
Edmonds matrix
@en