Fractional Product Cordial Labeling of Certain Graph Operations
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.
Authors
- S. Arul Amirtha Raja
- J. Janet Sheeba
- P. Matilda Shanthini
- P. Premakumari
Institutions
- SRM Institute of Science and Technology (IN)
- St. Joseph’s College of Engineering (IN)
- Loyola College (IN)
Publication Details
- Journal
- Gulf Journal of Mathematics
- Published
- 2026-11-20
- DOI
- https://doi.org/10.56947/9g5k8q02
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00