Metraipolis › archive › dc_27a76cc9caae

On Arithmetic Cordial Labeling of Product Graphs — arXiv:2608.11837

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11837
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:44.788Z
SHA-256 of the archived text
3f39850b8cd809165aab0ec34b2ad2efc6bcdbad7b2a77bccfd575559e00fc5d
Stable URL of this page
https://metraipolis.com/documento/dc_27a76cc9caae

How to cite

On Arithmetic Cordial Labeling of Product Graphs — arXiv:2608.11837 — arXiv (en), https://arxiv.org/abs/2608.11837 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_27a76cc9caae (Metraipolis archive dc_27a76cc9caae, sha256 3f39850b8cd809165aab0ec34b2ad2efc6bcdbad7b2a77bccfd575559e00fc5d)
BibTeX
@misc{dc27a76cc9caae,
  title = {On Arithmetic Cordial Labeling of Product Graphs — arXiv:2608.11837},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11837},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_27a76cc9caae; sha256 3f39850b8cd809165aab0ec34b2ad2efc6bcdbad7b2a77bccfd575559e00fc5d},
  year = {2026}
}

Archived text

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

Let $\eta$ be a fixed positive integer. Let $S$ be a subset of $\mathbb{Z}$, $\star:S\times S\to \mathbb{Z}$ be a binary function, and $\zeta_{\eta}:\{\xi\in \mathbb{Z}:\gcd(\xi,\eta)=1\}\to \{0,1\}$ be a function. For a simple graph $G$ of order $n$, a bijective function $f:V(G)\to S$ (where $|S|=n$) is called an arithmetic cordial labeling modulo $\eta$ under the arithmetic structure $\langle S,\zeta_\eta,\star\rangle$ if the induced function $f_\eta^*:E(G)\to \{0,1\}$, defined by $f_\eta^*(ab)=1$ whenever $\gcd(f(a)\star f(b),\eta)= 1$ and $\zeta_\eta(f(a)\star f(b))=1$; otherwise, $f_\eta^*(ab)=0$, satisfies the condition $|e_{f_\eta^*}(0)-e_{f_\eta^*}(1)|\leq 1$, where $e_{f_\eta^*}(i)$ is the number of edges with label $i$ ($i=0,1$). In this paper, the arithmetic cordial labeling of product graphs, namely, corona, lexicographic, cartesian, tensor, and strong, is explored under the operation of addition.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.11837 — 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-19T05:40:33.653Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).