Sanming Zhou

activity

20172022

most citedPerfect codes in circulant graphs

47 citations · 82 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2020

On subgroup perfect codes in Cayley graphs

Junyang Zhang, Sanming Zhou

A perfect code in a graph $Γ = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V ∖ C$ is adjacent to exactly one vertex in…

math.CO2017★ 47 cited

Perfect codes in circulant graphs

Rongquan Feng, He Huang, Sanming Zhou

A perfect code in a graph $Γ = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V ∖ C$ is adjacent to exactly one vertex in $C$ . A total…