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

Abstract: 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.Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP) © Copyright: All rights reserved