A Hamming graph H(n,m) is the cartesian product of the complete graph Km with itself n times.
I only know that the Hamming graphs are a particular case of vertex-transitive matrices that occur in association schemes, that they have applications in Coding Theory and that their spectrum est linked to the Krawtchouk polynomials. Hope those key-words can help you find more on the subject.
Since a Hamming graph is just a special subclass of Cartesian product graphs, this paper might be of interest for you: "Homogeneous factorisations of graph products", Giudici et al., Discr. Mathematics, vol. 308, no. 16, pp. 3652-3667, 2008
http://www.sciencedirect.com/science/article/pii/S0012365X07005493
In addition the results of homog. factorizations of complete graphs might be used for homog. fact. of Cartesian graph products of complete graphs: http://arxiv.org/pdf/math/0605253v1.pdf
A Hamming graph H(m,n) is the cartesian product of m copies of Kn. I am familiar with the papers of Guidicci and Praeger but can not find other papers than those written by them.
- Badges
- Science topic
- Similar topics
- Mathematical Sciences
- Graphs