EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS
2020 ◽
Vol 9
(11)
◽
pp. 9523-9525
Keyword(s):
A labeling of a graph $G$ with $\alpha$ vertices and $\beta$ edges called an edge odd graceful labeling if there is an edge labeling with odd numbers to all edges such that each vertex is assigned a label which is the sum $\mod (2\gamma)$ of labels of edge incident on it, where $\gamma=max\{\alpha,\beta\}$ and the induced vertex labels are distinct. In this paper, we discussed about edge odd gracefulness of some special class of flower petal graphs.
Keyword(s):
1981 ◽
Vol 4
(4)
◽
pp. 641-647
Keyword(s):
1974 ◽
Vol 32
◽
pp. 514-515
1980 ◽
Vol 9
(1)
◽
pp. 99-103
◽
Keyword(s):
2020 ◽
Vol 90
(5-6)
◽
pp. 411-416
◽
Keyword(s):
1986 ◽
Vol 47
(C1)
◽
pp. C1-347-C1-352
◽