Heron Mean Labeling Of Graphs

A (p, q) graph G is said to be a Heron mean graph if there exist a bijection f: v → {1,2, 3, ⋯ , p} such that induced function f ∗ : E(G) → N given by f ^∗ (uv) = u+vuv /3 or f ^∗ (uv) = u+vuv /3 for every uv ∈ E(G) are all distinct. In this paper the Heron mean labeling of path, cycle CN, K1,n,୬ if and only if n < 3, C_m ∪ P_n , C_m ∪ C_n, nk₃ , nk₃ ∪ P_m, nk₃ ∪ C_m , mC₄, crown Dragons Cn@k1 ,Square graph of path p_n² polygonal chain G_m,n are discussed.