Prime Labeling
Prime Labeling is a type of graph labeling in which each vertex is assigned a unique label from the set {1, 2, ..., n} such that any two adjacent vertices have labels that are relatively prime.
16
Publications
437
Citations
25
Authors
13
Institutions
Publications per year
2017–2026
0
Parents
16
Distinguishing Cartesian powers of graphs
Wilfried Imrich, Sandi Klavžar · Journal of Graph Theory · 2006 · 58 citations · Full text
On Prime Cordial Labeling of Graphs
Abdullah Aljouiee · Kyungpook mathematical journal · 2016 · 23 citations · Full text
1–5 of 16
25
6
h-index
3
h-index
2
h-index
1
h-index
1
h-index
1–5 of 25
13
Saurashtra University
Rajkot, India
5 h-index
5 publications
88 citations
St Xavier’s College
Ahmedabad, India
3 h-index
3 publications
39 citations
St. Xavier's College (Autonomous)
Palayamkottai, India
3 h-index
3 publications
39 citations

Gujarat University
Ahmedabad, India
1 h-index
2 publications
40 citations

University of Maribor
Maribor, Slovenia
1 h-index
1 publications
58 citations
Montanuniversität Leoben
Leoben, Austria
1 h-index
1 publications
58 citations

Western Illinois University
Macomb, United States
1 h-index
1 publications
23 citations

Smith College
Northampton, United States
1 h-index
1 publications
51 citations
1–8 of 13
OJDM · 3 publications · 38 citations
3
h-index
2 publications · 40 citations
2
h-index
1 publications · 23 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 110 citations
1
h-index
1–5