Detecting graphical and digraphical regular representations in groups of squarefree order
| dc.contributor.author | Morris, Joy | |
| dc.contributor.author | Verret, Gabriel | |
| dc.date.accessioned | 2025-11-05T21:46:23Z | |
| dc.date.available | 2025-11-05T21:46:23Z | |
| dc.date.issued | 2025 | |
| dc.description | Open access article. Creative Commons Attribution 4.0 International license (CC BY 4.0) applies | |
| dc.description.abstract | A necessary condition for a Cayley digraph Cay(R,S) to be a regular representation is that there are no non-trivial group automorphisms of R that fix S setwise. A group is DRR-detecting or GRR-detecting if this condition is also sufficient for all Cayley digraphs or graphs on the group, respectively. In this paper, we determine precisely which groups of squarefree order are DRR detecting, and which are GRR-detecting. | |
| dc.description.peer-review | Yes | |
| dc.identifier.citation | Morris, J., & Verret, G. (2025). Detecting graphical and digraphical regular representations in groups of squarefree order. Electronic Journal of Combinatorics, 32(2). Article P2.38. https://doi.org/10.37236/12476 | |
| dc.identifier.uri | https://hdl.handle.net/10133/7215 | |
| dc.language.iso | en | |
| dc.publisher.department | Department of Mathematics and Computer Science | |
| dc.publisher.faculty | Arts and Science | |
| dc.publisher.institution | University of Lethbridge | |
| dc.publisher.institution | University of Auckland | |
| dc.publisher.url | https://doi.org/10.37236/12476 | |
| dc.subject | Squarefree order | |
| dc.subject | Caley | |
| dc.subject | DRR-detecting | |
| dc.subject | GRR-detecting | |
| dc.subject | Graphical | |
| dc.subject | Digraphical | |
| dc.subject.lcsh | Mathematics--Study and teaching | |
| dc.title | Detecting graphical and digraphical regular representations in groups of squarefree order | |
| dc.type | Article |