Spectral Characterization of the Hamming Graphs

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.Hamming graphs;distance-regular graphs;eigenvalues of graphs

Annual Report of the Board of Regents of the Smithsonian Institution, showing the operations, expenditures, and condition of the Institution to July, 1893.

Annual Report of the Smithsonian Institution. 1 July. HMD 184 (pts. 1 and 2), 53-2, v29-30, 1622p. [3257-3258] Research related to the American Indian