arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.07368math.CO
收藏

凯莱图中子群完美码的特征

Characterization of subgroup perfect codes in Cayley graphs

Jiyong Chen, Yanpeng Wang, Binzhou Xia

摘要:

图$Γ$的顶点集的子集$C$称为$Γ$中的完美码,如果$Γ$的每个顶点到$C$的恰好一个顶点的距离不超过$1$.群$G$的子集$C$称为$G$的完美码,如果$C$是$G$的某个Cayley图中的完美码.本文给出了有限群$G$的子群$H$是$G$的完美码的充必要条件.在此基础上,我们确定了没有非平凡子群的有限群为完全码,回答了Ma,Walls,Wang和Zhou提出的一个问题.

英文摘要:

A subset $C$ of the vertex set of a graph $Γ$ is called a perfect code in $Γ$ if every vertex of $Γ$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if $C$ is a perfect code in some Cayley graph of $G$. In this paper we give sufficient and necessary conditions for a subgroup $H$ of a finite group $G$ to be a perfect code of $G$. Based on this, we determine the finite groups that have no nontrivial subgroup as a perfect code, which answers a question by Ma, Walls, Wang and Zhou.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑