Relaxed Skolam Mean Labeling of 6 – Star Graphs with Partition 3, 3
D.S.T. Ramesh1, D. Angel Jovanna2
1Dr. D.S.T.Ramesh*, Associate Professor, Department of Mathematics, Nazareth Margoschis College, Pillayanmanai, Tuticorin, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli – 627012, India.
2D. Angel Jovanna, Research Scholar, Department of Mathematics, Nazareth Margoschis College, Pillayanmanai, Tuticorin, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli – 627012, India.
Manuscript received on November 29, 2021. | Revised Manuscript received on December 01, 2021. | Manuscript published on December 30, 2021. | PP: 52-54 | Volume-11 Issue-2, December 2021. | Retrieval Number: 100.1/ijeat.B32811211221 | DOI: 10.35940/ijeat.B3281.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: Existence Relaxed skolam mean labeling for a 6 – star graph G = K1,α1 ∪K1,α2 ∪K1,α3 ∪K1,β1 ∪K1,β2 ∪K1,β3 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.
Keywords: Star Graphs, Union of Star Graph, Labeling, Skolem Mean Labeling, Relaxed Skolam Mean Graph.
Scope of the Article: Graph Algorithms and Graph Drawing.