A note on the number of perfect matchings of bipartite graphs (Q678856)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1004423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the number of perfect matchings of bipartite graphs |
scientific article; zbMATH DE number 1004423 |
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
0.8264329433441162
0 references
0.8165367841720581
0 references
