arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2112.06236math.CO
收藏

点传递图中的完美码

Perfect codes in vertex-transitive graphs

Yuting Wang, Junyang Zhang

摘要:

给定图$Γ$,$Γ$中的完美码是$Γ$的顶点的独立集$C$,使得$C$之外的每个顶点都与$C$中的唯一顶点相邻,并且$Γ$中的完全完美码是$Γ$的顶点的集合$C$,使得$Γ$的每个顶点都与$C$中的唯一顶点相邻。为了研究点传递图中的(全)完美码,我们将\cite{HXZ18}中引入的有限群的子群(全)完美码的概念推广如下:给定有限群$G$和$G$的子群$H$,含有$H$的$G$的亚组$A$称为亚组(总)如果存在陪集图$Cos(G,H,U)$,使得由$A$中的$H$的左陪集组成的集合是$Cos(G,H,U)$中的(全)完美码,则为$(G,H)$对的完美码。给出了$G$的包含$H$的子群$A$是群对$(G,H)$的(全)完美码的一个充要条件,推广了群的子群(全)完美码的一些已知结果.我们还构造了$(G,H)$的子群完美码的一些例子,并提出了一些有待进一步研究的问题。

英文摘要:

Given a graph $Γ$, a perfect code in $Γ$ is an independent set $C$ of vertices of $Γ$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code in $Γ$ is a set $C$ of vertices of $Γ$ such that every vertex of $Γ$ is adjacent to a unique vertex in $C$. To study (total) perfect codes in vertex-transitive graphs, we generalize the concept of subgroup (total) perfect code of a finite group introduced in \cite{HXZ18} as follows: Given a finite group $G$ and a subgroup $H$ of $G$, a subgroup $A$ of $G$ containing $H$ is called a subgroup (total) perfect code of the pair $(G,H)$ if there exists a coset graph $Cos(G,H,U)$ such that the set consisting of left cosets of $H$ in $A$ is a (total) perfect code in $Cos(G,H,U)$. We give a necessary and sufficient condition for a subgroup $A$ of $G$ containing $H$ to be a (total) perfect code of the pair $(G,H)$ and generalize a few known results of subgroup (total) perfect codes of groups. We also construct some examples of subgroup perfect codes of the pair $(G,H)$ and propose a few problems for further research.

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

↑