Counting matchings in graphs (Q579280)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting matchings in graphs |
scientific article |
Statements
Counting matchings in graphs (English)
0 references
1987
0 references
A general formula is derived for the matching polynomial of an arbitrary graph G. This yields a method for counting matchings in graphs. From the general formula, explicit formulae are deduced for the number of k- matchings in several well-known families of graphs.
0 references
matching polynomial
0 references
counting matchings
0 references
