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

Cayley图的完全完美码

Total perfect codes in Cayley graphs

Sanming Zhou

摘要:

图$Γ$中的完全完美码是$V(Γ)$的子集$C$,使得$Γ$的每个顶点恰好与$C$中的一个顶点相邻。给出了群的共轭闭子集在Cayley图中是全完美码的充要条件。作为应用,我们证明了初等交换$2$ -群上的Cayley图存在全完美码当且仅当它的度是$2$的幂.我们还得到了连通集在共轭下闭的群的Cayley图存在全完美码的必要条件。

英文摘要:

A total perfect code in a graph $Γ$ is a subset $C$ of $V(Γ)$ such that every vertex of $Γ$ is adjacent to exactly one vertex in $C$. We give necessary and sufficient conditions for a conjugation-closed subset of a group to be a total perfect code in a Cayley graph of the group. As an application we show that a Cayley graph on an elementary abelian $2$-group admits a total perfect code if and only if its degree is a power of $2$. We also obtain necessary conditions for a Cayley graph of a group with connection set closed under conjugation to admit a total perfect code.

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

↑