A STUDY ON ZERO-M CORDIAL LABELING
2020 ◽
Vol 9
(11)
◽
pp. 9207-9218
Keyword(s):
A labeling $f: E(G) \rightarrow \{1, -1\}$ of a graph G is called zero-M-cordial, if for each vertex v, the arithmetic sum of the labels occurrence with it is zero and $|e_{f}(-1) - e_{f}(1)| \leq 1$. A graph G is said to be Zero-M-cordial if a Zero-M-cordial label is given. Here the exploration of zero - M cordial labelings for deeds of paths, cycles, wheel and combining two wheel graphs, two Gear graphs, two Helm graphs. Here, also perceived that a zero-M-cordial labeling of a graph need not be a H-cordial labeling.
Keyword(s):
2019 ◽
2010 ◽
Vol 60
(7)
◽
pp. 2003-2008
◽
2001 ◽
Vol 24
(1)
◽
pp. 153-167
◽
Keyword(s):
2016 ◽
Vol 100
(9)
◽
pp. 1487-1503
2017 ◽
Vol 301
◽
pp. 177-186
◽
1995 ◽
Vol 59
(2)
◽
pp. 193-199
◽
Keyword(s):