• NEW FAMILIES OF 3-TOTAL PRODUCT CORDIAL GRAPHS

Abstract

Let be a map from V(G) to{0,1,...k-1}where k is an integer, For each edge uv assign the label
f(u) f(v)(modk). is called a k- Total Product cordial labeling if i,j {0,1,..k-1}, where f(x) denotes the total number of vertices and edges labelled with x(x=0,1,2....k-1). A graph that admits a k- Total Product cordial labelling is called a k- Total Product cordial graph. In this paper we investigate 3- Total Product cordial labeling behaviour of some standard graphs like Wheels, Helms, Dragons, etc.