10 research outputs found
Perfect codes in 2-valent Cayley digraphs on abelian groups
For a digraph , a subset of is a perfect code if
is a dominating set such that every vertex of is dominated by exactly
one vertex in . In this paper, we classify strongly connected 2-valent
Cayley digraphs on abelian groups admitting a perfect code, and determine
completely all perfect codes of such digraphs
Characterizing subgroup perfect codes by 2-subgroups
A perfect code in a graph is a subset of such that
no two vertices in are adjacent and every vertex in
is adjacent to exactly one vertex in . Let be a finite group and a
subset of . Then is said to be a perfect code of if there exists a
Cayley graph of admiting as a perfect code. It is proved that a
subgroup of is a perfect code of if and only if a Sylow
-subgroup of is a perfect code of . This result provides a way to
simplify the study of subgroup perfect codes of general groups to the study of
subgroup perfect codes of -groups. As an application, a criterion for
determining subgroup perfect codes of projective special linear groups
is given
On the subgroup regular set in Cayley graphs
A subset of the vertex set of a graph is said to be
-regular if induces an -regular subgraph and every vertex outside
is adjacent to exactly vertices in . In particular, if is an
-regular set of some Cayley graph on a finite group , then is
called an -regular set of and a -regular set is called a
perfect code of . In [Wang, Xia and Zhou, Regular sets in Cayley graphs, J.
Algebr. Comb., 2022] it is proved that if is a normal subgroup of , then
is a perfect code of if and only if it is an -regular set of
, for each and with . In this paper, we generalize this result and show that a subgroup of
is a perfect code of if and only if it is an -regular set of
, for each and such that
divides
On subgroup perfect codes in Cayley sum graphs
A perfect code in a graph is an independent set of vertices of
such that every vertex outside of is adjacent to a unique vertex
in , and a total perfect code in is a set of vertices of
such that every vertex of is adjacent to a unique vertex in
. Let be a finite group and a normal subset of . The Cayley sum
graph of with the connection set is the graph with
vertex set and two vertices and being adjacent if and only if
and . In this paper, we give some necessary conditions of a
subgroup of a given group being a (total) perfect code in a Cayley sum graph of
the group. As applications, the Cayley sum graphs of some families of groups
which admit a subgroup as a (total) perfect code are classified
Perfect codes in quintic Cayley graphs on abelian groups
A subset of the vertex set of a graph is called a perfect code
of if every vertex of is at distance no more than one to
exactly one vertex in . In this paper, we classify all connected quintic
Cayley graphs on abelian groups that admit a perfect code, and determine
completely all perfect codes of such graphs