• MEAN SQUARE SUM LABELING OF PATH RELATED GRAPHS

C. JAYASEKARAN*, M. JASLIN MELBHA

Abstract


Let G = (V, E) be a graph. A bijection f: →{0, 1, ..., p-1}  is said to be a mean square sum labeling if the induced function f*:E(G)→N given by f*(uv) =  or  for every uv  is injective. A graph which admits a mean square sum labeling is called a mean square sum graph. The concept of mean square sum labeling was introduced by C. Jayasekaran, S. Robinson Chellathurai and M. Jaslin Melbha and they investigated the mean square sum labeling of several standard graphs and some cycle related graphs. In this paper, we prove that composition of paths Pm and P2, , , D2(Pn), Splitting graph of path Pn, Switching of a pendant vertex in path Pn, Tn, DTn, Coconut tree and the graph obtained from Pn by attaching C3 in both the end edges of Pn are mean square sum graph.


Keywords


labeling, mean square sum labeling, mean square sum graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2021 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter