Spectral Characterization of the Hamming Graphs
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2007-81.
Date of creation: 2007
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Hamming graphs; distance-regular graphs; eigenvalues of graphs;
Other versions of this item:
- C0 - Mathematical and Quantitative Methods - - General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-10-20 (All new papers)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.