M = ( 1, 2, · · · , p 2 , 1 2 , 1 3 , · · · , 2 p+2, if p is even 1, 2, · · · , p−1 2 , 1 2 , 1 3 , · · · , 2 p+3, if p is odd Let χ : V (G) → M be a bijection.For each edge xy assign the label ⌈χ(x)χ(y)⌉. χ is called a fractional product cordial labeling (simply called FP-cordial labeling) if |Πχ(0) − Πχ(1)| ≤ 1, where Πχ(1) and Πχ(0) respectively denotes the number of edges labelled with 1 and not labelled with 1. A graph with a fractional product cordial labeling is called a fractional product cordial graph (Simply FP-cordial graph).We investigate the fractional product cordial labeling behaviour of lotus graph, necklace graph, hurdle graph, key graph, coconut tree, prism, mobious ladder, vanessa graph and udukkai graph.
Ponraj,R and Sutharson,T . (2025). FP-Cordial labeling of certain graph structures. Journal of Algorithms and Computation, 57(2), 139-149. doi: 10.22059/jac.2025.405991.1247
MLA
Ponraj,R , and Sutharson,T . "FP-Cordial labeling of certain graph structures", Journal of Algorithms and Computation, 57, 2, 2025, 139-149. doi: 10.22059/jac.2025.405991.1247
HARVARD
Ponraj R, Sutharson T. (2025). 'FP-Cordial labeling of certain graph structures', Journal of Algorithms and Computation, 57(2), pp. 139-149. doi: 10.22059/jac.2025.405991.1247
CHICAGO
R Ponraj and T Sutharson, "FP-Cordial labeling of certain graph structures," Journal of Algorithms and Computation, 57 2 (2025): 139-149, doi: 10.22059/jac.2025.405991.1247
VANCOUVER
Ponraj R, Sutharson T. FP-Cordial labeling of certain graph structures. J. Algo. Comp.. 2025;57(2):139-149. doi: 10.22059/jac.2025.405991.1247
