Speaker：Junyang Zhang（Chongqing Normal University）

Time：2022-11-23, 15:00

Location：Tencent Meeting ID：508-573-303（No Password）

Abstract:

A subset R of the vertex set of a graph Γ is said to be (j,k)-regular if R induces a j-regular subgraph and every vertex outside of R is adjacent to exactly k vertices in R. In particular, a (j,k)-regular set is called a perfect code if (j,k)=(0,1) and a total perfect code of if (j,k)=(1,1). This talk presents some recent results (of the reporter and others) involving regular sets in Cayley graphs, and perfect codes and total perfect codes in Cayley graphs, vertex-transitive graphs and Cayley sum graphs.