Classification and recursive method for perfect matching number of two kinds of special graphs (Q4996038)
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: Classification and recursive method for perfect matching number of two kinds of special graphs |
scientific article; zbMATH DE number 7366265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classification and recursive method for perfect matching number of two kinds of special graphs |
scientific article; zbMATH DE number 7366265 |
Statements
1 July 2021
0 references
perfect matching
0 references
recurrence formula
0 references
general solution
0 references
0.9372794032096864
0 references
0.9310609102249146
0 references
0.9090632796287536
0 references
0.9061098098754884
0 references
0.8971903920173645
0 references
