On bounding the bandwidth of graphs with symmetry (Q2942684)
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 6480970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On bounding the bandwidth of graphs with symmetry |
scientific article; zbMATH DE number 6480970 |
Statements
On Bounding the Bandwidth of Graphs with Symmetry (English)
0 references
11 September 2015
0 references
bandwidth
0 references
minimum cut
0 references
semidefinite programming
0 references
Hamming graphs
0 references
Johnson graphs
0 references
Kneser graphs
0 references
0.8339377045631409
0 references
0.8250844478607178
0 references
0.7788530588150024
0 references
0.7751857042312622
0 references
