(Total) Perfect codes in (extended) subgroup sum graphs

Abstract

Given a finite group $G$ with identity $e$ and a normal subgroup $H$ of $G$, the subgroup sum graph $\hat{I}{“}_{G,H}$ (resp. extended subgroup sum graph $\hat{I}{“}_{G,H}^{+}$) of $G$ with respect to $H$ is the graph with vertex set $G$, in which distinct vertices $x$ and $y$ are adjacent whenever $xy\in H\setminus \{e\}$ (resp. $xy\in H$). A group $G$ is said to be {\em code-perfect} if for any normal subgroup $H$ of $G$, $\hat{I}{“}_{G,H}$ admits a perfect code. In this paper, we give a necessary and sufficient condition for which normal subgroups $H$ of $G$ satisfy that a (extended) subgroup sum graph of $G$ with respect to $H$ admits a (total) perfect code, and classify all code-perfect Dedekind groups. As an application, we classify all normal subgroups such that the subgroup sum graph of a cyclic group, a dihedral group or a dicyclic group with respect to such a normal subgroup admits perfect codes, respectively. We also determine all abelian groups $A$ and subgroups $H$ of $A$ such that $\hat{I}{“}_{A,H}$ admits a total perfect code.