Document Type : Research Paper
Authors
1 Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India
2 Research Scholar, Department of Mathematics, Sri Paramakalyani College, Alwarkurichi.
Abstract
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.
Keywords
)