scholarly journals Common closed neighbourhood prime labeling

2021 ◽  
Vol 1836 (1) ◽  
pp. 012009
Author(s):  
Rinurwati ◽  
A S Alfiyani
Keyword(s):  
2021 ◽  
Author(s):  
T. Malathi ◽  
K. Balasangu
Keyword(s):  

2016 ◽  
Vol 73 (2) ◽  
pp. 810-836 ◽  
Author(s):  
Jinhyun Ahn ◽  
Dong-Hyuk Im ◽  
Taewhi Lee ◽  
Hong-Gee Kim
Keyword(s):  

2020 ◽  
Vol 172 ◽  
pp. 649-654
Author(s):  
Teresa Arockiamary S ◽  
Vijayalakshmi G
Keyword(s):  

2021 ◽  
Vol 12 (1) ◽  
pp. 1
Author(s):  
M. D. M. C. P. Weerarathna ◽  
T. R. D. S. M. Thennakoon ◽  
K. D. E. Dhananjaya ◽  
A. A. I. Perera
Keyword(s):  

2018 ◽  
Vol 16 (1) ◽  
pp. 133-140
Author(s):  
Rajesh Kumar T.J ◽  
◽  
Mathew Varkey T.K
Keyword(s):  

2020 ◽  
Vol 3 (3) ◽  
pp. 33-40
Author(s):  
Maged Zakaria Youssef ◽  
◽  
Zainab Saad Almoreed ◽  

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.


Sign in / Sign up

Export Citation Format

Share Document