Strong matching preclusion for \(k\)-composition networks (Q1698726)
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 6839808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong matching preclusion for \(k\)-composition networks |
scientific article; zbMATH DE number 6839808 |
Statements
Strong matching preclusion for \(k\)-composition networks (English)
0 references
16 February 2018
0 references
strong matching preclusion
0 references
almost perfect matching
0 references
perfect matching
0 references
interconnection networks
0 references
0.9556247
0 references
0.89618707
0 references
0.89586616
0 references
0.8931583
0 references
0.8914323
0 references
0.8903792
0 references
0.88132477
0 references
0.8807858
0 references
0.88077146
0 references
