Counting formulas of the number of perfect matchings for four types of graphs (Q4926746)
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: Counting formulas of the number of perfect matchings for four types of graphs |
scientific article; zbMATH DE number 6178964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting formulas of the number of perfect matchings for four types of graphs |
scientific article; zbMATH DE number 6178964 |
Statements
20 June 2013
0 references
graph
0 references
counting perfect matchings
0 references
linear recurrence relation
0 references
characteristic equation
0 references
0.966812551021576
0 references
0.9220001697540284
0 references
0.9070587158203124
0 references
0.8992787003517151
0 references
