Table of Content
Lucas cordial labeling
Open AccessArticleOn Lucas Cordial Labeling of Some Snake Graphs
Ariel C. Pedrano* and Ernesto R. Salise Jr.
Annals of Communications in Mathematics 2025,
8 (4),
451-458
DOI: https://doi.org/10.62072/acm.2025.080403
ABSTRACT. An injective function \( f : V(G) \to \{L_1, L_2, \ldots, L_n\} \), where \( L_j \) is the \( j^{\text{th}} \) Lucas number \( (j=1,2,\ldots,n) \), is said to be a Lucas cordial labeling if the induced function \( f^{*} : E(G) \to \{0,1\} \) defined by \( f^{*}(uv) = (f(u)+f(v)) \pmod 2 \) satisfies \( |e_f(0)-e_f(1)| \le 1 \). A graph admitting such labeling is called a Lucas cordial graph.




