Extra Skolem Difference Mean Labeling of Various Graphs

Abstract

Let graph G=(V(G),E(G)) attains a Skolem difference mean labeling with p vertices and q edges is said to be an extra Skolem difference mean labeling of graph G if all the labels of the vertices are odd. The graph which attains an extra Skolem difference mean labeling is called an extra Skolem difference mean graph. We obtain an extra Skolem difference mean labeling for Comb graph, Twig of a path P_n, H graph of a path P_n, K_1,2*K_(1,n) graph, K_1,3*K_(1,n) graph, m- Join of H_n, P_n⊙K_(1,m) graph , HSS(P_n) graph, H⊙〖mK〗_1-graph of a path P_n.