A note on regular sets in Cayley graphs
Junyang Zhang, Yanhong Zhu

TL;DR
This paper investigates the properties of regular sets within Cayley graphs, establishing conditions under which normal subgroups form regular sets based on parameters like regularity degree and adjacency counts.
Contribution
It provides new criteria for when normal subgroups of a finite group form regular sets in Cayley graphs, especially relating to the parity of the adjacency parameter.
Findings
If is even, the normal subgroup is a (, au)-regular set.
If is odd, the subgroup is a (, au)-regular set iff it is a (0,1)-regular set.
Conditions depend on subgroup normality and parameters , , and .
Abstract
A subset of the vertex set of a graph is said to be -regular if induces a -regular subgraph and every vertex outside is adjacent to exactly vertices in . In particular, if is a -regular set of some Cayley graph on a finite group , then is called a -regular set of . Let be a non-trivial normal subgroup of , and and a pair of integers satisfying , and . It is proved that (i) if is even, then is a -regular set of ; (ii) if is odd, then is a -regular set of if and only if it is a -regular set of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNuclear Receptors and Signaling · Finite Group Theory Research · Rings, Modules, and Algebras
