(SI10-089) Integer Cordial Labeling of Alternate Snake Graph And Irregular Snake Graph

If a graph G admits integer cordial labeling, it is called an integer cordial graph. In this paper we prove that Alternate m-triangular Snake graph, Quadrilateral Snake graph, Alternate m- quadrilateral Snake graph, Pentagonal Snake graph, Alternate m-pentagonal Snake graph, Irregular triangular Snake graph, Irregular quadrilateral Snake graph, and Irregular pentagonal Snake graphs are integer cordial graphs

Extra Skolem Difference Mean Labeling of Various Graphs

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