Abstract
In this article, we discussed Power-3 Heronian odd Mean Labeling for some path related graphs. A function is said to be Power 3 Heronian odd mean labeling of a graph G with q edges, if f is a bijective function from the vertices of G to the set{1,3,5,.......2p-1}such that when each edges uv is assigned the label, then the resulting edge labels are distinct numbers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have