University Of Tehran Press Journal of Algorithms and Computation 2476-2776 57 2 2025 12 31 FP-Cordial labeling of certain graph structures 139 149 106211 10.22059/jac.2025.405991.1247 EN R Ponraj Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India T Sutharson Research Scholar, Department of Mathematics, Sri Paramakalyani College, Alwarkurichi. Journal Article 2025 11 10 M =<br />(<br />1, 2, · · · , p<br />2 , 1<br />2 , 1<br />3 , · · · , 2<br />p+2, if p is even<br />1, 2, · · · , p−1<br />2 , 1<br />2 , 1<br />3 , · · · , 2<br />p+3, if p is odd<br />Let χ : V (G) → M be a bijection.For each edge xy assign<br />the label ⌈χ(x)χ(y)⌉. χ is called a fractional product<br />cordial labeling (simply called FP-cordial labeling)<br />if |Πχ(0) − Πχ(1)| ≤ 1, where Πχ(1) and Πχ(0) respectively<br />denotes the number of edges labelled with 1 and<br />not labelled with 1. A graph with a fractional product<br />cordial labeling is called a fractional product cordial<br />graph (Simply FP-cordial graph).We investigate<br />the fractional product cordial labeling behaviour<br />of lotus graph, necklace graph, hurdle<br />graph, key graph, coconut tree, prism, mobious ladder,<br />vanessa graph and udukkai graph. https://jac.ut.ac.ir/article_106211_d4e75210ea77cfb687388367655f9d7f.pdf