Near Meanness on Special Types of Graphs
A. Nellai Murugan · International Journal of Mathematics Trends and Technology · 2014
Let G = (V, E) be a graph with p vertices and q edges and let f: V(G) → { 0, 1, 2, ...., q-1, q+1} be an injection. The graph G is said to have a near mean labeling if for each edge, there exist an induced injective map f * : E(G) → {1, 2, ...., q} defined by f * (uv) =