On Sd-Prime Cordial Graphs

Abstract

Let G = (V (G), E(G)) be a simple, finite and undirected graph of order n. Given a bijection f : V (G) → {1, . . . , n}, we associate 2 integers S = f (u) + f (v) and admits an SD-prime cordial labeling. In this paper, we investigate the SD-prime cordiality of some standard graphs.

SD-Prime cordial labeling of alternate k-polygonal snake of various types

“…For all detailed survey of graph labeling we refer [2]. Lau, Chu, Suhadak, Foo, and Ng [3] have introduced SD-prime cordial labeling and they proved behaviour of several graphs like path, complete bipartite graph, star, double star, wheel, fan, double fan and ladder. Lourdusamy and Patrick [4] proved that S 0 (K 1,n ), D 2 (K 1,n ), S(K 1,n ), DS(K 1,n ), S 0 (B n,n ), D 2 (B n,n ), T L n , DS(B n,n ), S(B n,n ), K 1,3 K 1,n , CH n , F l n , P 2 n , T (P n ), T (C n ), Q n , A(T n ), P n¯K1 , C n¯K1 , J n and the graph obtained by duplication of each vertex and cycle by an edge are SD-prime cordial.…”

SD and k-SD Prime Cordial graphs

“…Lau et al was introduced a variant of prime graph labeling of graph in [6]. In [7], Lau et al introduced SD-prime cordial labeling and they discussed SD-prime cordial labeling for some standard graphs. In [9], Lourdusamy et al investigated some new construction of SD-prime cordial graph.…”

Some results on SD-Prime cordial labeling

“…For all detailed survey of graph labeling we to refer Gallian [1]. In [4,5], G.C. Lau and W.C. Shiu have introduced the concepts SD-prime labeling.…”

“…Lau and W.C. Shiu have introduced the concepts SD-prime labeling. In [3], G. C. Lau et.al. have introduced SD-prime cordial labeling and they proved behaviour of several graphs like path, complete bipartite graph, star, double star, wheel, fan, double fan and ladder are SD-prime cordial labeling.…”