Some Results on Super Harmonic Mean Graphs

Abstract

Let G be a graph with p vertices and q edges. Let f: V(G) → {1, 2, …, p + q} be a injective function. For a vertex labeling f, the induced edge labeling f * (e = uv) is defined by f * (e) = () () () () or () () () (). Then f is called a Super harmonic mean labeling if f(V(G))∪{f(e) / e ϵ E(G)} = {1, 2, …, p + q}. A graph which admits Super harmonic mean labeling is called Super harmonic mean graphs. In this paper, we investigate Super harmonic mean labeling of some graphs.

Some results on super Heronian mean labeling of graphs

“…The notion of "Harmonic Mean Labeling" has introduced by S. Somasundaram, R. Ponraj and S.S. Sandhya [4]. C. Jeyasekaran, S.S. Sandhya and C. David Raj has introduced "Super Harmonic Mean Labeling" [5]. S.S. Sandhya, E. Ebin Raja Merly and G.D. Jemi has introduced Super Heronian Mean Labeling.…”