arXiv (All)
open access
Isomorphisms of abelian Cayley graphs with their natural edge-colouring
We prove that if $φ$ is an isomorphism between two connected Cayley graphs of abelian groups, and $φ$ respects the natural edge-colourings of the Cayley graphs, then $φ$ is the composition of a group isomorphism and a colour-preserving graph automorphism. This implies that if every colour-preserving
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
- Composing group automorphisms with colour-preserving automorphisms of Cayley graphs#987315
- Reduction of the group isomorphism problem to the group automorphism problem#984832
- Automorphism groups of Cayley graphs on almost simple groups with normal connection sets#1036071
- A note on test elements for monomorphisms of free groups#972876
- The chromatic noncommutative symmetric function of oriented trees#985113
Record · ID 987301
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