Relaxed Skolam Mean Labeling of 5 – Star Graphs with Partition 3, 2

Abstract

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.