Matching preclusion number of graphs (Q1711840)
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: Matching preclusion number of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching preclusion number of graphs |
scientific article |
Statements
Matching preclusion number of graphs (English)
0 references
18 January 2019
0 references
interconnection networks
0 references
perfect matching
0 references
matching preclusion number
0 references
Nordhaus-Gaddum problem
0 references
extremal problem
0 references
0 references
0 references
0.96447706
0 references
0.94370013
0 references
0.94299567
0 references
0.9269365
0 references
0.91122955
0 references
0.9054114
0 references
0.90527457
0 references
0.9038707
0 references
0.8999258
0 references
