arXiv (All)
open access
Algebraic characterizations of generating and affinely generating $Γ$-magic maps and $Γ$-distance magic labelings on regular graphs
For an abelian group $Γ$ of order $n$, a graph $G$ of order $n$ is $Γ$-distance magic if it admits a bijection $V(G)\toΓ$ whose open-neighborhood sums are constant, and group distance magic if this holds for every such $Γ$. More generally, for any finite abelian $Γ$, a $Γ$-magic map is a map $f\colo
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
- The Reduced Smith Group of a Kneser Graph and Its Application to Group-Valued Magic Maps#1070039
- Conjugation invariants determine the metacommutation permutation only up to relabelling#610015
- Conjugation invariants determine the metacommutation permutation only up to relabelling#608953
- On the Hamming distance properties of group codes#490073
- On Codes in (Generalized) Symmetric Groups#985142
Record · ID 973549
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