Dihedral groups of square-free order are DCI-groups

A finite group G is called a DCI-group if any two isomorphic Cayley digraphs of G are also isomorphic via an automorphism of G . If G is a non-abelian generalised dihedral DCI-group, then Dobson, Muzychuk, and Spiga proved that G must be a dihedral group of square-free order (Ars Math. Contemp., 2022). In this paper, we prove that the converse statement also holds, i.e. all dihedral groups of square-free order are DCI-groups.

Authors

Institutions

Publication Details

Journal
Algebraic Combinatorics
Published
2026-10-27
DOI
https://doi.org/10.5802/alco.514
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dihedral groups of square-free order are DCI-groups

Gábor Somlai, István Kovács
1 links
Algebraic Combinatorics
Finite Group Theory Research
article

Dihedral groups of square-free order are DCI-groups

Gábor Somlai, István Kovács
article en

Abstract

A finite group G is called a DCI-group if any two isomorphic Cayley digraphs of G are also isomorphic via an automorphism of G . If G is a non-abelian generalised dihedral DCI-group, then Dobson, Muzychuk, and Spiga proved that G must be a dihedral group of square-free order (Ars Math. Contemp., 2022). In this paper, we prove that the converse statement also holds, i.e. all dihedral groups of square-free order are DCI-groups.

Algebraic CombinatoricsVol. 9(5)
Eötvös Loránd University (HU), University of Primorska (SI)
Hungarian Scientific Research Fund
Openalex Percentile: Top 81%
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon