Many more Families of Mean Graphs
Selvam Avadayappan, R. Sinthu · International Journal of Mathematics and Soft Computing · 2014
Abstract Let G(V,E) be a graph with p vertices and q edges. For every assignment , an induced edge labeling is defined by For every edge If , then we say that f is a mean labeling of G. If a graph G admits a mean labeling, then G is called a mean graph. In this paper, we prove that the graphs C n +v 1 v 3 (n≥4), C 2 (P n ), n≥2, and the balloon of the triangular snake are mean graphs.