Perfect code;
Total perfect code;
Efficient dominating set;
Efficient open dominating set;
Total perfect dominating set;
Cayley graph;
EFFICIENT DOMINATION;
SETS;
D O I:
10.1007/s10623-015-0169-0
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
A total perfect code in a graph Gamma is a subset C of V(Gamma) such that every vertex of Gamma 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.