Fractional Product Cordial Labeling of Certain Graph Operations
Main Article Content
Abstract
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.
Article Details
Issue
Section
Articles
How to Cite
Fractional Product Cordial Labeling of Certain Graph Operations. (2026). Gulf Journal of Mathematics, 24(2). https://doi.org/10.56947/9g5k8q02