RELAXED SKOLEM MEAN LABELING OF 6 - STAR GRAPHS WITH PARTITION (5, 1)
Existence Relaxed skolem mean labeling for a 6 – star graph G=K_(1,α_1 )∪K_(1,α_2 )∪K_(1,α_3 )∪K_(1,α_4 )∪K_(1,α_5 )∪K_(1,β) with partition 5, 1 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 skolem mean labeling of 6 – star graph with partition 5, 1 holding a specific condition.
Star Graph, Union of Star Graphs, Labeling, Skolem Mean Labeling, Relaxed Skolem Mean Graph.