Regular sets in Cayley graphs

Yanpeng Wang, Binzhou Xia, Sanming Zhou

In a graph $\Gamma$ with vertex set $V$, a subset $C$ of $V$ is called an $(a,b)$-perfect set if every vertex in $C$ has exactly $a$ neighbors in $C$ and every vertex in $V\setminus C$…