On Total Product Cordial Labeling of Some Snake Graphs
Annals of Communications in Mathematics · 01.06.2026
DOI: 10.62072/acm.2026.09024 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 01.06.2026. Verfasst von Rex Ryan A. Marquez und 1 weiteren Autor:innen.
Abstract (Originalsprache)
A total product cordial labeling of a graph G is a function f : V → {0, 1}. For each xy, assign the label f(x)f(y), f is called total product cordial labeling of G if it satisfies the condition that |vf (0) + ef (0) − vf (1) − ef (1)| ≤ 1 where vf (i) and ef (i) denote the set of vertices and edges which are labeled with i = 0, 1, respectively. A graph with a total product cordial labeling defined on it is called a total product cordial graph. In this paper, we determined the total product cordial labeling of the snake graphs Tn,A(Tn), D(Tn), DA(Tn), Qn, A(Qn), D(Qn), and DA(Qn).
Zitieren
APA
Marquez, R. R. A., & Pedrano, A. C. (2026). On Total Product Cordial Labeling of Some Snake Graphs. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09024
Vancouver
Marquez RRA, Pedrano AC. On Total Product Cordial Labeling of Some Snake Graphs. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09024
BibTeX
@article{Marquez2026,
author = {Marquez, Rex Ryan A. and Pedrano, Ariel C.},
title = {On Total Product Cordial Labeling of Some Snake Graphs},
journal = {Annals of Communications in Mathematics},
year = {2026},
doi = {10.62072/acm.2026.09024}
}
EUVIMED