A note on the automorphism group of the Hamming graph

Abstract

Let $\Omega$ be a $m$-set, where $m>1$, is an integer. The Hamming graph $H(n,m)$, has ${\Omega }^n$ as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate. In this paper, we provide a proof on the automorphism group of the Hamming graph $H(n,m)$, by using elementary facts of group theory and graph theory.

arXiv comment8 pages, 1 figures

References in corpus (2)

• A note on the automorphism groups of Johnson graphs
• Cubic vertex-transitive non-Cayley graphs of order 12p

Cited by in corpus (1)

• Dynamics of genetic code evolution: The emergence of universality