Recurrence calculation of the perfect matchings number of two types of graphs (Q5209760)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recurrence calculation of the perfect matchings number of two types of graphs |
scientific article; zbMATH DE number 7156201
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recurrence calculation of the perfect matchings number of two types of graphs |
scientific article; zbMATH DE number 7156201 |
Statements
22 January 2020
0 references
perfect matching
0 references
linear recurrence relation
0 references
characteristic equation
0 references
0.9303469657897948
0 references
0.911936104297638
0 references
0.9067349433898926
0 references
0.902259886264801
0 references
