A note on the automorphism group of the Hamming graph
classification
🧮 math.GR
keywords
graphgrouphammingautomorphismomegatheoryadjacentcoordinate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.