Skip to content

Perfect codes in t -Cayley graphs

Oct 2026 · Journal of Algebra and its Applications · 0 citations

Abstract

Let [Formula: see text] be a finite group and [Formula: see text]. Let [Formula: see text] be a collection of subsets of [Formula: see text] such that [Formula: see text] is non-empty, [Formula: see text] and [Formula: see text] for all [Formula: see text]. The t-Cayley graph of G associated with [Formula: see text], [Formula: see text], is a graph whose vertex set is [Formula: see text] and for [Formula: see text] and [Formula: see text] with [Formula: see text], the set [Formula: see text] is an edge if and only if [Formula: see text]. In this work, we study perfect codes in a [Formula: see text]-Cayley graph of [Formula: see text]. Let [Formula: see text] be a subgroup of [Formula: see text] and [Formula: see text]. We have a necessary and sufficient condition for a collection [Formula: see text] of subsets of [Formula: see text] such that [Formula: see text] is a perfect code in [Formula: see text]. Moreover, we obtain a criterion for determining if [Formula: see text] is a perfect code in some [Formula: see text]-Cayley graph of [Formula: see text].

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.