Relaxed Skolam Mean Labeling of 6 – Star Graphs with Partition 3, 3
2021 ◽
Vol 11
(2)
◽
pp. 52-54
Keyword(s):
The Core
◽
Existence Relaxed skolam mean labeling for a 6 – star graph 3 G = K1,α K1,α K1,α K1,β K1,β K1,β 1 2 3 1 2 ∪ ∪ ∪ ∪ ∪ with partition 3,3 with a certain condition is the core topic of the following article. Trial and error method is used to find the existence of the relaxed skolam mean labeling of 6 - star graph with partition 3, 3 holding a specific condition.
2021 ◽
Vol 11
(2)
◽
pp. 9-11
Keyword(s):
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):