SD-Prime Cordial Labeling of Double k-Polygonal Snake Graph

A graph is called an SD-prime cordial graph if it admits SD-prime cordial labeling. This chapter considers a finite, simple and undirected graph of specific order. Graph obtained by duplication of each vertex and cycle by an edge are SD-prime cordial. The union of star and path graphs along with the subdivision of comb graph, subdivision of ladder graph and the graph obtained by attaching a star graph at one end of the path are SD-prime cordial graphs. Union of two SD-prime cordial graphs need not be an SD-prime cordial graph. The chapter investigates the SD-prime cordial labeling behavior of a double k-polygonal snake graph.