Fractional Product Cordial Labeling of Certain Graph Operations
Gulf Journal of Mathematics · 20.11.2026 · 24 (2)
DOI: 10.56947/9g5k8q02 ↗Kurz gefasst
Fachartikel in der Zeitschrift Gulf Journal of Mathematics, online erschienen am 20.11.2026. Verfasst von J. Janet Sheeba und 3 weiteren Autor:innen.
Abstract (Originalsprache)
Fractional product cordial labeling assigns distinct whole numbers and unit fractions to graph vertices and labels each edge by rounding up the product of its end values. We prove that the number of edges labeled one takes every integer value between its minimum and maximum, and that its average exceeds half the number of edges. A graph admits such a labeling exactly when some labeling gives at least half of its edges, rounded down, a label other than one. We settle trees, unicyclic graphs, and subdivision, switching, duplication, line and middle graphs of paths, cycles, stars and related families.
Zitieren
APA
Sheeba, J. J., Raja, S. A. A., Premakumari, P., & Shanthini, P. M. (2026). Fractional Product Cordial Labeling of Certain Graph Operations. Gulf Journal of Mathematics, 24(2). https://doi.org/10.56947/9g5k8q02
Vancouver
Sheeba JJ, Raja SAA, Premakumari P, Shanthini PM. Fractional Product Cordial Labeling of Certain Graph Operations. Gulf Journal of Mathematics. 2026;24(2). doi:10.56947/9g5k8q02
BibTeX
@article{Sheeba2026,
author = {Sheeba, J. Janet and Raja, S. Arul Amirtha and Premakumari, P. and Shanthini, P. Matilda},
title = {Fractional Product Cordial Labeling of Certain Graph Operations},
journal = {Gulf Journal of Mathematics},
year = {2026},
volume = {24},
number = {2},
doi = {10.56947/9g5k8q02}
}
EUVIMED