Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs (Q3385916)
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: Perfect matching counts for 2-2nP₅ and 2-nK₁,1,1,3 graphs |
scientific article; zbMATH DE number 7295414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs |
scientific article; zbMATH DE number 7295414 |
Statements
14 January 2021
0 references
perfect matching
0 references
classification
0 references
recurrence relation
0 references
counting formula
0 references
0.8889667391777039
0 references
0.8670386672019958
0 references
0.8651012778282166
0 references
0.864058792591095
0 references
0.8592169880867004
0 references
