On arithmetic cordial labeling of some graphs
Open Journal of Mathematical Sciences · 01.05.2026 · 10 (1) · 438-454
DOI: 10.30538/oms2026.0297 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Journal of Mathematical Sciences, online erschienen am 01.05.2026. Verfasst von Jason D. Andoyo und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Let η be a fixed positive integer. Let S be a subset of ℤ, ⋆ : S × S → ℤ be a binary function, and ζη : {ξ ∈ ℤ : gcd (ξ, η) = 1} → {0, 1} be a function. For a simple connected graph G of order n, a bijective function f : V(G) → S (where |S| = n) is called an arithmetic cordial labeling modulo η under the arithmetic structure ⟨S, ζη, ⋆⟩ if the induced function fη* : E(G) → {0, 1}, defined by fη*(ab) = 1 whenever gcd (f(a) ⋆ f(b), η) = 1 and ζη(f(a) ⋆ f(b)) = 1; otherwise, fη*(ab) = 0, satisfies the condition |efη*(0) − efη*(1)| ≤ 1, where efη*(i) is the number of edges with label i (i = 0, 1). In this paper, we explore the arithmetic cordial labeling of some graphs under conditions imposed on the function ζη. The graphs included are star graphs, ladder graphs, alternate cycle snake graphs, join graphs, corona graphs, and tensor product graphs.
Zitieren
APA
Andoyo, J. D., Prudencio, J. C. C., & Rulete, R. F. (2026). On arithmetic cordial labeling of some graphs. Open Journal of Mathematical Sciences, 10(1), 438-454. https://doi.org/10.30538/oms2026.0297
Vancouver
Andoyo JD, Prudencio JCC, Rulete RF. On arithmetic cordial labeling of some graphs. Open Journal of Mathematical Sciences. 2026;10(1):438-454. doi:10.30538/oms2026.0297
BibTeX
@article{Andoyo2026,
author = {Andoyo, Jason D. and Prudencio, Jemina Clarisse C. and Rulete, Ricky F.},
title = {On arithmetic cordial labeling of some graphs},
journal = {Open Journal of Mathematical Sciences},
year = {2026},
volume = {10},
number = {1},
pages = {438--454},
doi = {10.30538/oms2026.0297}
}
EUVIMED