E-resources
Peer reviewed
Open access
-
Seyed Morteza Mirafzal; Meysam Ziaee
Transactions on combinatorics, 06/2021, Volume: 10, Issue: 2Journal Article
Let $m>1$ be an integer and $\Omega$ be an $m$-set. 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 new proof on the automorphism group of the Hamming graph $H(n,m)$. Although our result is not new (CE Praeger, C Schneider, Permutation groups and Cartesian decompositions, Cambridge University Press, 2018), we believe that our proof is shorter and more elementary than the known proofs for determining the automorphism group of Hamming graph.
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.