On prime Cayley graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914316196773888 |
|---|---|
| author | Chudnovsky, Maria Cizek, Michal Crew, Logan Mináč, Ján Nguyen, Tung T. Spirkl, Sophie Tân, Nguyên Duy |
| author_facet | Chudnovsky, Maria Cizek, Michal Crew, Logan Mináč, Ján Nguyen, Tung T. Spirkl, Sophie Tân, Nguyên Duy |
| contents | 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? |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_06062 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On prime Cayley graphs Chudnovsky, Maria Cizek, Michal Crew, Logan Mináč, Ján Nguyen, Tung T. Spirkl, Sophie Tân, Nguyên Duy Combinatorics Group Theory 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? |
| title | On prime Cayley graphs |
| topic | Combinatorics Group Theory |
| url | https://arxiv.org/abs/2401.06062 |