On odd prime labeling of graphs
2020 ◽
Vol 3
(3)
◽
pp. 33-40
In this paper we give a new variation of the prime labeling. We call a graph \(G\) with vertex set \(V(G)\) has an odd prime labeling if its vertices can be labeled distinctly from the set \(\big\{1, 3, 5, ...,2\big|V(G)\big| -1\big\}\) such that for every edge \(xy\) of \(E(G)\) the labels assigned to the vertices of \(x\) and \(y\) are relatively prime. A graph that admits an odd prime labeling is called an <i>odd prime graph</i>. We give some families of odd prime graphs and give some necessary conditions for a graph to be odd prime. Finally, we conjecture that every prime graph is odd prime graph.
Keyword(s):
2012 ◽
Vol 11
(04)
◽
pp. 1250077
◽
Keyword(s):
2014 ◽
Vol 91
(2)
◽
pp. 227-240
◽
Keyword(s):
2010 ◽
Vol 20
(07)
◽
pp. 847-873
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 08
(01)
◽
pp. 105-114
◽
Keyword(s):
2018 ◽
Vol 7
(4.10)
◽
pp. 389
2021 ◽
Vol 2106
(1)
◽
pp. 012030
2020 ◽
Vol 13
(1)
◽
pp. 84-95
Keyword(s):