Metraipolis › archive › dc_35337b9e4ff2

Algebraic characterizations of generating and affinely generating $Γ$-magic maps and $Γ$-distance magic labelings on regular graphs — arXiv:2609.05934

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05934
License (as archived)
CC0-1.0
Archived
2026-10-16T14:48:29.726Z
SHA-256 of the archived text
9d3bc4765784f021853feeb38967540d6898d5568c4d7d81a3b772398e107a29
Stable URL of this page
https://metraipolis.com/documento/dc_35337b9e4ff2

How to cite

Algebraic characterizations of generating and affinely generating $Γ$-magic maps and $Γ$-distance magic labelings on regular graphs — arXiv:2609.05934 — arXiv (en), https://arxiv.org/abs/2609.05934 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_35337b9e4ff2 (Metraipolis archive dc_35337b9e4ff2, sha256 9d3bc4765784f021853feeb38967540d6898d5568c4d7d81a3b772398e107a29)
BibTeX
@misc{dc35337b9e4ff2,
  title = {Algebraic characterizations of generating and affinely generating $Γ$-magic maps and $Γ$-distance magic labelings on regular graphs — arXiv:2609.05934},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05934},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_35337b9e4ff2; sha256 9d3bc4765784f021853feeb38967540d6898d5568c4d7d81a3b772398e107a29},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05934. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For an abelian group $\Gamma$ of order $n$, a graph $G$ of order $n$ is $\Gamma$-distance magic if it admits a bijection $V(G)\to\Gamma$ whose open-neighborhood sums are constant, and group distance magic if this holds for every such $\Gamma$. More generally, for any finite abelian $\Gamma$, a $\Gamma$-magic map is a map $f\colon V(G)\to\Gamma$ with constant open-neighborhood sums; we call $f$ generating if its labels generate $\Gamma$, and affinely generating if its pairwise differences do. Let $G$ be regular, let $\Gamma\cong\mathbb{Z}/d_1\oplus\cdots\oplus\mathbb{Z}/d_r$ with $d_1\mid\cdots\mid d_r$, put $B_\Gamma=\bigoplus_{i<r}\mathbb{Z}/d_i$, and let $\overline{A}_m$ be the adjacency operator induced on $(\mathbb{Z}/m)^{V(G)}$ modulo constants. We prove that $G$ admits a generating $\Gamma$-magic map iff $B_\Gamma\hookrightarrow\ker\overline{A}_{d_r}$, and an affinely generating one iff $\Gamma\hookrightarrow\ker\overline{A}_{d_r}$; when $|V(G)|=|\Gamma|$, it is $\Gamma$-distance magic iff the latter embedding has vertex-separating image. If the reduced adjacency operator is nonsingular over $\mathbb{Q}$, these become subgroup conditions in the reduced adjacency Smith group. Cichacz and Froncek conjectured that every distance magic graph is group distance magic. Using the affine criterion we construct a $6$-regular distance magic graph of order $27$ admitting no affinely generating $(\mathbb{Z}/3)^3$-magic map, so the conjecture fails even for affine generation. We propose the generating group distance magic conjecture, and prove it for regular distance magic graphs whenever $\Gamma$ is $2$-generated, hence for cube-free order. Further applications concern Cayley graphs on elementary abelian $p$-groups, Hamming relation graphs, strongly regular graphs, and symmetric designs.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.05934 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.769Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).