Journal article Open Access

Power-3 Heronian Mean Labeling of Graphs

M.Kaaviya Shree; K.Sharmilaa

Sponsor(s)
Blue Eyes Intelligence Engineering & Sciences Publication(BEIESP)

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.

Files (628.9 kB)
Name Size
D7831049420 (1).pdf
md5:8006a49837e1415c538a63e53bd902e7
628.9 kB Download
20
10
views
downloads
Views 20
Downloads 10
Data volume 6.3 MB
Unique views 19
Unique downloads 9

Share

Cite as