Neighbourhood Cordial and Neighbourhood Product Cordial Labeling of Graphs

Abstract

In this paper, we introduce the various types of neighbourhood cordial labeling of graphs and present the neighbourhood cordial labeling of kP 2 ,

Neighbourhood Cordial and Neighbourhood Product Cordial Labeling of Graphs

“…In [6], Sundaram et al also introduce the concept of total product cordial labeling of graph. Motivated by the study of various types of cordial labeling and neighbourhood concept in Graph theory, we introduce neighbourhood cordial labeling, total neighbourhood cordial labeling, neighbourhood product cordial labeling and total neighbourhood product cordial labeling of G. In [4], Muthaiyan et. al., also prove the graphs C n C m C r , P n P m P r , C n P m K 1,r,r , C n K 1,m K 1,r,r and P n K 1,m K 1,r,r are neighbourhood cordial graphs under some conditions, the graphs P n P m and C n C m are total neighbourhood cordial graphs under some conditions and present the neighbourhood product cordial and total neighbourhood product cordial labeling of path and cycle related disconnected graphs.…”