The counting formula of the perfect matchings of three types of special graphs (Q4642923)
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 6874008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The counting formula of the perfect matchings of three types of special graphs |
scientific article; zbMATH DE number 6874008 |
Statements
25 May 2018
0 references
perfect matching
0 references
ladder
0 references
recurrence relation
0 references
chessboard
0 references
0.9793941974639891
0 references
0.9212711453437804
0 references
0.9159573316574096
0 references
0.9152372479438782
0 references
0.912967324256897
0 references
