A note on the automorphism group of the Hamming graph
Abstract
Let be a m-set, where m>1, is an integer. The Hamming graph H(n,m), has 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.