Year: 2026
Type: article
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.
Source: Gulf Journal of Mathematics
DOI: 10.56947/9g5k8q02
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7237211472
