Spectral characterization of the Hamming graphs Original Research Article

We show that the Hamming graph H(3,q) with diameter three is uniquely determined by its spectrum for qgreater-or-equal, slanted36. Moreover, we show that for given integer Dgreater-or-equal, slanted2, 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.