关于Hamming图的自同构群的注记

S. Mirafzal, M. Ziaee
{"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}
引用次数: 7

摘要

设$\ ω $是一个$m$-集合,其中$m>1$是一个整数。汉明图$H(n,m)$以$\ ^{n}$作为顶点集,两个顶点相邻当且仅当它们在一个坐标上不同。本文利用群论和图论的基本事实,给出了Hamming图$H(n,m)$的自同构群的证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信