Skip to content
Preprint

Composing group automorphisms with colour-preserving automorphisms of Cayley graphs

Sep 2026 · 0 citations · 12 references
Mathematics

Abstract

We show that if $\varphi$ is a colour-permuting automorphism of a connected, finite Cayley graph, and the order of the Cayley graph is either odd or square-free, then $\varphi$ is the composition of a group automorphism and a colour-preserving graph automorphism. Some analogous results are also established for isomorphisms between two different Cayley graphs.

View source

Similar papers

Preprint Sep 2026

Prime-valent Symmetric Cayley Graphs of Characteristically Simple Groups

Let $\Ga$ be a connected prime-valent $X$-arc-transitive Cayley graph of a finite characteristically simple group $G\cong T^k$, where $k\geqslant2$. We obtain a precise structural characterization of such graphs and their arc-transitive automorphism groups. In the cubic case, every connected symmetric Cayley graph of $...

Feng Deng, Jing-Jian Li, Hao Yu · 0 citations
Preprint Sep 2026

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

We determine the full automorphism group of every connected Cayley graph on an almost simple group with a normal connection set. We also characterize exactly when the full automorphism group is generated by right translations, group automorphisms preserving the connection set, and inversion. Our results substantially g...

Meng-Yue Cao, Ben-Jian Lv, Bin-Zhou Xia · 0 citations
Preprint Sep 2026

Isomorphisms of abelian Cayley graphs with their natural edge-colouring

We prove that if $\varphi$ is an isomorphism between two connected Cayley graphs of abelian groups, and $\varphi$ respects the natural edge-colourings of the Cayley graphs, then $\varphi$ is the composition of a group isomorphism and a colour-preserving graph automorphism. This implies that if every colour-preserving a...

Shirin Alimirzaei, D. Morris · 2 citations
Preprint Aug 2026

Ergodic-transformation centralizers and essentially non-compact graphing symmetry

We prove that for every ergodic transformation $T$ on an infinite standard probability space both the automorphism group (i.e. centralizer) $\mathrm{Aut}(T)$ and its reversing automorphism group are realizable as symmetry groups of graphings. This is an analogue of Sabidussi's realization of arbitrary graph-automorphis...

Alexandru Chirvăsitu · 0 citations
Preprint Sep 2026

Simple Cayley permutations

We propose a notion of simplicity for Cayley permutations that is compatible with inflation. We prove that Cayley permutations admit a substitution decomposition analogous to that of permutations and use it to enumerate simple Cayley permutations, primitive simple Cayley permutations, and simple restricted growth funct...

Giulio Cerbai, Anders Claesson · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.