A Study on the Labeling of Certain Graphs using Prime Correspondence

Abstract

Let graph. A bijection induces an edge labeling such that for any edge if otherwise. where and we say that f is SD- prime labeling if for all . G is SD prime if it admits SD prime labeling.The labeling f is called SD prime cordial labeling if it satisfies , where is number of edges labeled by and respectively. is SD prime cordial if it admits SD prime cordial labeling. In this paper we proved that and if , admits Prime Cordial. A graph that admits prime cordial labeling is called prime cordial graphs.