arXiv (All)
open access
Composing group automorphisms with colour-preserving automorphisms of Cayley graphs
We show that if $φ$ 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 $φ$ is the composition of a group automorphism and a colour-preserving graph automorphism. Some analogous results are also established for
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Isomorphisms of abelian Cayley graphs with their natural edge-colouring#987301
- Automorphism groups of Cayley graphs on almost simple groups with normal connection sets#1036071
- The automorphism group of the derangement graph of $\operatorname{PGL}_{2}(q)$ acting on the projective line#1117681
- On a class of combinatorial group invariants#1034332
- On Nilpotent and Hypocentral Quandle Homomorphisms#1083726
Record · ID 987315
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive