A note on regular sets in Cayley graphs
Abstract
A subset R of the vertex set of a graph is said to be (,τ)-regular if R induces a -regular subgraph and every vertex outside R is adjacent to exactly τ vertices in R. In particular, if R is a (,τ)-regular set of some Cayley graph on a finite group G, then R is called a (,τ)-regular set of G. Let H be a non-trivial normal subgroup of G, and and τ a pair of integers satisfying 0≤≤|H|-1, 1≤τ≤|H| and (2,|H|-1). It is proved that (i) if τ is even, then H is a (,τ)-regular set of G; (ii) if τ is odd, then H is a (,τ)-regular set of G if and only if it is a (0,1)-regular set of G.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.