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 such that induced function f ^∗ : E(G) → N given byf ^∗ (uv) =u+V√uv/3 or f ^∗ (uv)=u+V√uv/3 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₃∪pm    nK₃∪c_m,mc₄ crown C_n Θ  K₁Dragons C_n@P_m ,Square graph of path P_n²polygonal chain G_m,n are discussed.