POWER-3 HERONIAN MEAN LABELING OF GRAPHS

Abstract

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.