9 citations · 11 across the 2 of their papers we have counts for
3 papers
math.CO2021★ 9 cited
Subgroup regular sets in Cayley graphs
Yanpeng Wang, Binzhou Xia, Sanming Zhou
Let be a graph with vertex set , and let and be nonnegative integers. A subset of is called an -regular set in if every vertex in has exactly…
math.CO2020
Regular sets in Cayley graphs
Yanpeng Wang, Binzhou Xia, Sanming Zhou
In a graph with vertex set , a subset of is called an -perfect set if every vertex in has exactly neighbors in and every vertex in …
math.CO2019★ 2 cited
Characterization of subgroup perfect codes in Cayley graphs
Jiyong Chen, Yanpeng Wang, Binzhou Xia
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 to exactly one vertex of . A subset of a…