K - parity mean cordial labeling of graphs

Abstract

Cordial labeling was first introduced by I. Cahit in 1987 [1]. Consequently difference cordial, product cordial labeling, prime cordial, mean cordial labeling etc., were introduced and studied by R. Ponraj et. al. [4,7,8]. In this paper we introduce a new notion called ‘k-parity Mean Cordial Labeling of Graphs’ and we investigate its behavior for some standard graphs.