Open AccessRelaxed Skolam Mean Labeling of 6 – Star Graphs with Partition 3, 3
Author(s) -
D. S. T. Ramesh,
AUTHOR_ID,
D. Angel Jovanna,
AUTHOR_ID
Publication year - 2021
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.b3281.1211221
Subject(s) - partition (number theory) , mathematics , star (game theory) , combinatorics , graph , discrete mathematics , mathematical analysis
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.