On Lucas Product Cordial Labeling of Some Snake Graphs
Annals of Communications in Mathematics · 31.03.2026
DOI: 10.62072/acm.2026.09007 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 31.03.2026. Verfasst von Cherry T. Magoncia und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
An injective function f : V (G) → {l1, l2, . . . , ln}, where lj is the jth Lucas number (j = 1, 2, . . . , n) is said to be Lucas product cordial labeling if the induced function f∗ : E(G) → {0, 1} defined by f ∗(uv) = (f(u)f(v)) (mod 2) satisfies the condition |ef∗ (0) − ef∗ (1)| ≤ 1. A graph which admits Lucas product cordial labeling is called Lucas product cordial graph. In this paper, we determined the Lucas Product Cordial Labeling of Quadrilateral Snake Graph Qn, Cycle Quadrilateral Snake Graph CQn, and Alternate Triangular Snake Graph A(Tn).
Zitieren
APA
Magoncia, C. T., & Benacer, E. D. (2026). On Lucas Product Cordial Labeling of Some Snake Graphs. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09007
Vancouver
Magoncia CT, Benacer ED. On Lucas Product Cordial Labeling of Some Snake Graphs. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09007
BibTeX
@article{Magoncia2026,
author = {Magoncia, Cherry T. and Benacer, Eva D.},
title = {On Lucas Product Cordial Labeling of Some Snake Graphs},
journal = {Annals of Communications in Mathematics},
year = {2026},
doi = {10.62072/acm.2026.09007}
}
EUVIMED