Mean labeling of graphs obtained by identifying two graphs
Raja Ponraj, S. Somasundaram · Journal of Discrete Mathematical Sciences and Cryptography · 2008
A graph G=(V, E) with p vertices and q edges is said to be a mean graph if it is possible to label the vertices x∈V with distinct elements f (x) from 0, 1, 2, …, q in such a way that when each edge e=uv is labelled with (f(u)+f(v))/2 if f (u)+f (v) is even and (f (u)+f (v)+1)/2 if f (u)+f (v) is odd, then the resulting edge labels are distinct. f is called a mean labeling of G. In this paper, we investigate the mean labeling of caterpillar, dragon, arbitrary super subdivision of a path and some graphs which are obtained from cycles and stars.