Relaxed Skolam Mean Labeling of 5 – Star Graphs with Partition 3, 2 
D.S.T. Ramesh1, D. Angel Jovanna2
1Dr. D.S.T.Ramesh*, Associate Professor Department of Mathematics in Nazareth Margoschis College, Pillayanmanai, Tuticorin (Tamil Nadu), India.
2D. Angel Jovanna, Research Scholar Department of Mathematics in Nazareth Margoschis College, Pillayanmanai, Tuticorin (Tamil Nadu), India.
Manuscript received on November 10, 2021. | Revised Manuscript received on November 15, 2021. | Manuscript published on December 30, 2021. | PP: 9-11 | Volume-11 Issue-2, December 2021. | Retrieval Number: 100.1/ijeat.B32501211221 | DOI: 10.35940/ijeat.B3250.1211221
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this article, our main topic is about the existence of relaxed skolem mean labeling for a 5 – star graph G = K1,α1 ∪ K1,α2 ∪ K1,α3 ∪ K1,β1 ∪ K1,β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.
Keywords: Star Graphs, Union of Star Graphs, Mean Labeling, Relaxed Skolem Mean Labeling, Relaxed Skolam Mean Graph.
Scope of the Article: Graph Algorithms and Graph Drawing.