Indexed metadata
On the isomorphism problem of Cayley digraphs
Péter P. Pálfy
Source abstract
A finite group is called a DCI-group provided any two Cayley digraphs and are isomorphic iff the two connection sets and are images of each other via automorphisms of the group . Building on the vast literature on CI- and DCI-groups we present an updated list of possible DCI-groups. In addition, we give an alternative proof that does not rely on deep results from group theory. We also point out the three most important open problems related to the classification of DCI-groups.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.