The decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications. In this paper, we utilize tools from group theory and ring theory to study this problem when the network is a Cayley graph. In particular, we answer the following question: Which Cayley graphs are prime?
Cite
@article{arxiv.2401.06062,
title = {On prime Cayley graphs},
author = {Maria Chudnovsky and Michal Cizek and Logan Crew and Ján Mináč and Tung T. Nguyen and Sophie Spirkl and Nguyên Duy Tân},
journal= {arXiv preprint arXiv:2401.06062},
year = {2026}
}