2000 character limit reached
Regular sets in Cayley sum graphs on generalized dicyclic groups
Published 10 Jul 2025 in math.CO | (2507.07736v1)
Abstract: For a graph , a subset of is called an -regular set in , if every vertex of is adjacent to exactly vertices of and every vertex of is adjacent to exactly vertices of . In particular, if is an -regular set in some Cayley sum graph of a finite group with connection set , then is called an -regular set of . In this paper, we consider a generalized dicyclic group and for each subgroup of , by giving an appropriate connection set , we determine each possibility for such that is an -regular set of .
Paper Prompts
Sign up for free to create and run prompts on this paper.