Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results and spectral techniques for combinatorial problems on circulant graphs |
scientific article |
Statements
Hardness results and spectral techniques for combinatorial problems on circulant graphs (English)
0 references
28 November 1999
0 references
circulant matrices
0 references
eigenvalues
0 references
eigenvectors
0 references
chromatic number
0 references
clique
0 references
approximation algorithms
0 references
circulant graphs
0 references
