On Edouard Product Cordial Labeling of Some Graphs
Annals of Communications in Mathematics · 31.03.2026
DOI: 10.62072/acm.2026.09003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 31.03.2026. Verfasst von Jan Carl M. Vertudes.
Abstract (Originalsprache)
Let G be the a graph. An Edouard Product Cordial Labeling (EPCL) of a graph G with |V (G)| = n is an injective function f : V (G) → {E0, E1, E2, . . . , En−1} where Ei is the ith Edouard number (i = 0, 1, 2, 3, . . . , n) that induced a function f∗ defined by f∗(uv) = (f(u)f(v)) (mod 2) for all edge e = uv such that |e∗f(0) − e∗f(1)| ≤ 1 where e∗f(0) is the number of verticeslabeled with 0 and e∗f(1) is the number of vertices labeled with 1. The graph that satisfies the condition of a edouard product cordial labeling is called an edouard product cordial graph (EPCG).
Zitieren
APA
Vertudes, J. C. M. (2026). On Edouard Product Cordial Labeling of Some Graphs. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09003
Vancouver
Vertudes JCM. On Edouard Product Cordial Labeling of Some Graphs. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09003
BibTeX
@article{Vertudes2026,
author = {Vertudes, Jan Carl M.},
title = {On Edouard Product Cordial Labeling of Some Graphs},
journal = {Annals of Communications in Mathematics},
year = {2026},
doi = {10.62072/acm.2026.09003}
}
EUVIMED