Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs (Q3056376)
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 5815502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs |
scientific article; zbMATH DE number 5815502 |
Statements
Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs (English)
0 references
12 November 2010
0 references
interconnection networks
0 references
\((n, k)\)-bubble-sort graphs
0 references
perfect matching
0 references
Cayley graphs
0 references
Hamiltonian
0 references
0.9291334
0 references
0.9236997
0 references
0.9118277
0 references
0 references
0.89556956
0 references
0.89322746
0 references
0.89265454
0 references
0.8900855
0 references
