Relaxed Skolam Mean Labeling of 5 – Star Graphs with Partition 3, 2
2021 ◽
Vol 11
(2)
◽
pp. 9-11
Keyword(s):
In this article, our main topic is about the existence of relaxed skolem mean labeling for a 5 – star graph G = K1,α ∪ K1,α ∪ K1,α ∪ K1, β ∪ K1, β 1 2 3 1 2 with partition 3, 2 with a certain condition. By using the trial and error method we find the existence of the relaxed skolam mean labeling of 5 - star graph with partition 3, 2 with a specific condition.
2020 ◽
Vol 2020
(30)
◽
pp. 75-87
1960 ◽
Vol 56
(4)
◽
pp. 318-321
◽
Keyword(s):
2016 ◽
Vol 4
(29)
◽
pp. 11446-11452
◽
Keyword(s):
2009 ◽
Vol 424
◽
pp. 197-204
◽
Keyword(s):
Keyword(s):
2021 ◽
Keyword(s):