A note on the number of perfect matchings of bipartite graphs (Q678856): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1566002 |
||
Property / author | |||
Property / author: Fu Ji Zhang / rank | |||
Revision as of 01:21, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the number of perfect matchings of bipartite graphs |
scientific article |
Statements
A note on the number of perfect matchings of bipartite graphs (English)
0 references
15 September 1997
0 references
For a plane bipartite graph of \(2n\) nodes, it is known that the determinant of its adjacency matrix \(A\) and the number \(K\) of perfect matchings is related by \(\text{det }A= (- 1)^nK^2\). For a general bipartite graph, this note gives a necessary and sufficient condition for this relation to hold. A fast algorithm to check if a plane bipartite graph has such a property is given.
0 references
plane bipartite graph
0 references
adjacency matrix
0 references
perfect matchings
0 references
fast algorithm
0 references