On subgroup perfect codes in Cayley sum graphs

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: A perfect code

C

in a graph

G a m m a

is an independent set of vertices of

G a m m a

such that every vertex outside of

C

is adjacent to a unique vertex in

C

, and a total perfect code

C

in

G a m m a

is a set of vertices of

G a m m a

such that every vertex of

G a m m a

is adjacent to a unique vertex in

C

. Let

G

be a finite group and

X

a normal subset of

G

. The Cayley sum graph

m a t h r m C S (G, X)

of

G

with the connection set

X

is the graph with vertex set

G

and two vertices

g

and

h

being adjacent if and only if

g h i n X

and

g e q h

. 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.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: On subgroup perfect codes in Cayley sum graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6191098)