Perfect codes in t -Cayley graphs
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], [...