Abstract
We show that the Hamming graph H(3.q) with diameter three is uniquely determined by its spectrum for q ≥ 36. Moreover, we show that for given integer D ≥ 2, any graph cospectral with the Hamming graph H(D,q) is locally the disjoint union of D copies of the complete graph of size q-1, for q large enough.
| Original language | English |
|---|---|
| Pages (from-to) | 2678-2686 |
| Journal | Linear Algebra and its Applications |
| Volume | 429 |
| Issue number | 11-12 |
| Publication status | Published - 2008 |
Fingerprint
Dive into the research topics of 'Spectral characterizations of the Hamming graph'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver