{"title":"关于Hamming图的自同构群的注记","authors":"S. Mirafzal, M. Ziaee","doi":"10.22108/TOC.2021.127225.1817","DOIUrl":null,"url":null,"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.","PeriodicalId":8427,"journal":{"name":"arXiv: Group Theory","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A note on the automorphism group of the Hamming graph\",\"authors\":\"S. Mirafzal, M. Ziaee\",\"doi\":\"10.22108/TOC.2021.127225.1817\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":8427,\"journal\":{\"name\":\"arXiv: Group Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Group Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2021.127225.1817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Group Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2021.127225.1817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A note on the automorphism group of the Hamming graph
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.