Matching preclusion number in product graphs (Q1725689)
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 7023761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching preclusion number in product graphs |
scientific article; zbMATH DE number 7023761 |
Statements
Matching preclusion number in product graphs (English)
0 references
14 February 2019
0 references
interconnection networks
0 references
perfect matching
0 references
matching preclusion
0 references
Cartesian product
0 references
lexicographic product
0 references
direct product
0 references
strong product
0 references
join
0 references
cluster
0 references
corona
0 references
0 references
0 references
0 references
0.9144346714019777
0 references
0.886838972568512
0 references
0.8797277808189392
0 references
0.8795205354690552
0 references
0.8774226903915405
0 references
