Tight upper bound on the maximum anti-forcing numbers of graphs (Q4560210)
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: Tight upper bound on the maximum anti-forcing numbers of graphs |
scientific article; zbMATH DE number 6991610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight upper bound on the maximum anti-forcing numbers of graphs |
scientific article; zbMATH DE number 6991610 |
Statements
10 December 2018
0 references
maximum anti-forcing number
0 references
perfect matching
0 references
edge-involution
0 references
Cartesian product
0 references
hypercube
0 references
folded hypercube
0 references
math.CO
0 references
0.8780180811882019
0 references
0.8472505211830139
0 references
0.8023070096969604
0 references
0.8004098534584045
0 references
0.7987509369850159
0 references
