Embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph.

Under study is the relationship between the eigenfunctions of the Johnson and Hamming graphs. An eigenfunction of a graph is an eigenvector of its adjacency matrix with some eigenvalue; moreover, an eigenfunction can be identically zero. We find a criterion for the embeddability of an eigenfunction of the Johnson graph J( n, w) with a given eigenvalue into a certain eigenfunction of the Hamming graph with a given eigenvalue. [ABSTRACT FROM AUTHOR]