Counting matchings in graphs (Q579280)
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 4014768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting matchings in graphs |
scientific article; zbMATH DE number 4014768 |
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
0.94415057
0 references
0.9358306
0 references
0.92956424
0 references
0.9280745
0 references
0.92773896
0 references
0.9266366
0 references
