Perfect codes in Cayley sum graphs

From MaRDI portal

Jump to:navigation, search

DOI10.37236/9792MaRDI QIDQ2073316zbMATH OpenOpenAlexFDO

Authors Kaishun Wang, Yuefeng Yang, Xuanlong Ma

Publication date 1 February 2022

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2007.08163

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

efficient dominating set subgroup perfect code

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Abstract: A subset

C

of the vertex set of a graph

G a m m a

is called a perfect code of

G a m m a

if every vertex of

G a m m a

is at distance no more than one to exactly one vertex in

C

. Let

A

be a finite abelian group and

T

a square-free subset of

A

. The Cayley sum graph of

A

with respect to the connection set

T

is a simple graph with

A

as its vertex set, and two vertices

x

and

y

are adjacent whenever

x + y i n T

. A subgroup of

A

is said to be a subgroup perfect code of

A

if the subgroup is a perfect code of some Cayley sum graph of

A

. In this paper, we give some necessary and sufficient conditions for a subset of

A

to be a perfect code of a given Cayley sum graph of

A

. We also characterize all subgroup perfect codes of

A

.

Summary: A subset \(C\) of the vertex set of a graph \(\Gamma\) is called a perfect code of \(\Gamma\) if every vertex of \(\Gamma\) is at distance no more than one to exactly one vertex in \(C\). Let \(A\) be a finite abelian group and \(T\) a square-free subset of \(A\). The Cayley sum graph of \(A\) with respect to the connection set \(T\) is a simple graph with \(A\) as its vertex set, and two vertices \(x\) and \(y\) are adjacent whenever \(x+y\in T\). A subgroup of \(A\) is said to be a subgroup perfect code of \(A\) if the subgroup is a perfect code of some Cayley sum graph of \(A\). In this paper, we give some necessary and sufficient conditions for a subset of \(A\) to be a perfect code of a given Cayley sum graph of \(A\). We also characterize all subgroup perfect codes of \(A\).

Recommendations

Cites work

Cited in

(25)

This page was built for publication: 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 Q2073316)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Perfect_codes_in_Cayley_sum_graphs&oldid=71270913"