فهرست نشریات علمی دسترسی آزاد ایران

M =(1, 2, · · · , p2 , 12 , 13 , · · · , 2p+2, if p is even1, 2, · · · , p−12 , 12 , 13 , · · · , 2p+3, if p is oddLet χ : V (G) → M be a bijection.For each edge xy assignthe label ⌈χ(x)χ(y)⌉. χ is called a fractional productcordial labeling (simply called FP-cordial labeling)if |Πχ(0) − Πχ(1)| ≤ 1, where Πχ(1) and Πχ(0) respectivelydenotes the number of edges labelled with 1 andnot labelled with 1. A graph with a fractional productcordial labeling is called a fractional product cordialgraph (Simply FP-cordial graph).We investigatethe fractional product cordial labeling behaviourof lotus graph, necklace graph, hurdlegraph, key graph, coconut tree, prism, mobious ladder,vanessa graph and udukkai graph.