摘要
一个图的顶点子集D称为完全完备码,如果该图中的每个顶点恰与D中一个顶点相邻.给出了凯莱子集中含有2阶元的交换群上4度凯莱图的完全完备码存在的充分必要条件.
A subset D of the vertex set of a graph is called a total perfect code if each vertex of this graph is adjacent to exactly one vertex in D.In this paper,we give the necessary and sufficient conditions for an abelian quartic Cayley graph with involutions in the Cayley subset to have total perfect codes.
作者
王燕
张星
WANG Yan;ZHANG Xing(School of Mathematics and Information Science,Yantai University,Yantai 264005,China)
出处
《数学的实践与认识》
2022年第3期252-256,共5页
Mathematics in Practice and Theory
基金
山东省自然科学基金(ZR2020MA044)
烟台大学教改项目(jyxm2021050)。
关键词
交换群
凯莱图
完全完备码
abelian group
cayley graph
total perfect code
