Groups for which it is easy to detect graphical regular representations

DOI10.26493/2590-9770.1373.60AMaRDI QIDQ5045250zbMATH OpenOpenAlexFDO

Authors Joy Morris, Gabriel Verret, David Witte Morris

Publication date 4 November 2022

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.09798

zbMATH Keywords

automorphism groupCayley graphDRRGRRnormalizer

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General theory for finite permutation groups (20B05)

Abstract: We say that a finite group G is "DRR-detecting" if, for every subset S of G, either the Cayley digraph Cay(G,S) is a digraphical regular representation (that is, its automorphism group acts regularly on its vertex set) or there is a nontrivial group automorphism phi of G such that phi(S) = S. We show that every nilpotent DRR-detecting group is a p-group, but that the wreath product of two cyclic groups of order p is not DRR-detecting, for every odd prime p. We also show that if G and H are nontrivial groups that admit a digraphical regular representation and either gcd(|G|,|H|) = 1, or H is not DRR-detecting, then the direct product G x H is not DRR-detecting. Some of these results also have analogues for graphical regular representations.

Recommendations

• On circulant digraphs with regular automorphism groups
• Digraphical regular representations of infinite finitely generated groups
• On quasiabelian Cayley graphs and graphical doubly regular representations
• The automorphism groups of minimal infinite circulant digraphs
• Cayley graphs on abelian groups

Cites work

• Automorphism groups of wreath product digraphs
• Classification of finite groups that admit an oriented regular representation
• Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups
• Direct product of automorphism groups of digraphs
• Finite digraphs with given regular automorphism groups
• scientific article; zbMATH DE number 3724352 (Why is no real title available?)
• scientific article; zbMATH DE number 3552764 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• On products of graphs and regular groups
• On the full automorphism group of a graph
• Strict refinement for graphs and digraphs

Cited in

(3)

• On circulant digraphs with regular automorphism groups
• The core of a vertex transitive complementary prism of a lexicographic product
• Detecting graphical and digraphical regular representations in groups of squarefree order

This page was built for publication: Groups for which it is easy to detect graphical regular representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045250)