European Journal of Molecular & Clinical Medicine

Abstract

Let be a order-  and size-  graph. Let be a 1-1 function from the set to    Each edge , receives the label  Then the function  is called a difference cordial labelling if  is and where and refers the number of edges having  as its label and not having  as its label respectively. If  receives labeling which is a difference cordial is difference cordial graph. In this paper, the difference cordial for generalised Petersen graph is analysed and proved the existence of difference cordial.