3 papers
math.CO2026
Characterizing Finite Groups via Subgroup Perfect Codes
Binbin Li, Jingjian Li, Wei Meng +1
A perfect code in a graph is a subset of such that no two vertices in are adjacent and every vertex in is adjacent to exactly one vertex in…
math.CO2025
Subgroup Perfect Codes of -Groups and Their Applications
Huye chen, Binbin Li, Jingjian Li +1
A subset of the vertex set of a graph is called a perfect code in if every vertex of is at distance no more than 1 to exactly one vertex of . A subgroup o…
math.CO2025
A Note on Subgroup Perfect Codes in Cayley Graphs
Li Jingjian, Li Binbin, Liu Xianglin
In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of ext…