Mean Labeling of Some Graphs

N. Revathi

Abstract: A graph G with p vertices and q edges is a mean graph if there is an injective function f from the vertices of G to {0, 1, 2,. q} such that when each edge uv is labeled with (f (u) +f (v)) /2 if f (u) +f (v) is evenand (f (u) +f (v) +1) /2if f (u) +f (v) is odd then the resulting edges are distinct. In this paper we investigate mean labeling of shadow graph of bistar and comb and splitting graph of comb.

Keywords: Mean labeling, comb, splitting graph, shadow graph, bistar

How to Cite?: N. Revathi, "Mean Labeling of Some Graphs", Volume 4 Issue 10, October 2015, International Journal of Science and Research (IJSR), Pages: 1921-1923, https://www.ijsr.net/getabstract.php?paperid=23101501, DOI: https://dx.doi.org/10.21275/23101501