ON THE EMBEDDING OF EIGENFUNCTIONS OF THE JOHNSON GRAPH INTO EIGENFUNCTIONS OF THE HAMMING GRAPH
We study a connection between eigenfunctions of the Johnson and Hamming graphs. An eigenfunction of a graph is an eigenvector with a given eigenvalue of its adjacency matrix, therewith an eigenfunction can be zero function. We find a criterion for embedding of the Johnson graph’s J(n, w) eigenfunction with a given eigenvalue in a certain Hamming graph’s eigenfunction with a given eigenvalue.