Power-3 Heronian Mean Labeling of Graphs
M.Kaaviya Shree1, K.Sharmilaa2
1M.Kaaviya Shree*, Department of Mathematics (PG), PSGR Krishnammal College for Women, Coimbatore, Tamilnadu, India.
2K.Sharmilaa, Department of Mathematics (PG), PSGR Krishnammal College for Women, Coimbatore, Tamilnadu, India.
Manuscript received on March 30, 2020. | Revised Manuscript received on April 05, 2020. | Manuscript published on April 30, 2020. | PP: 1359-1361 | Volume-9 Issue-4, April 2020. | Retrieval Number: D7831049420/2020©BEIESP | DOI: 10.35940/ijeat.D7831.049420
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: Let be an undirected graph having vertices and edges. Now, defining a function say, is called Power-3 Heronian Mean Labeling of a graph if we could able to label the vertices with dissimilar elements from such that it induces an edge labeling defined as, is dissimilar for all the edges (i,e.) It intimates that the dissimilar vertex labeling induces a dissimilar edge labeling on the graph. The graph which owns Power-3 Heronian Mean Labeling is called an Power-3 Heronian Mean Graph. In this, we have advocated the Power-3 Heronian Mean Labeling of some standard graphs like Path, Comb, Caterpillar, Triangular Snake, Quadrilateral Snake and Ladder.
Keywords: Power-3 Heronian Mean Labeling, Power-3 Heronian Mean Graph, Path, Comb, Caterpillar, Triangular Snake, Quadrilateral Snake and Ladder.