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.

A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. In this paper we prove that some disconnected graphs are Harmonic mean graphs.

No abstract