Some New Classes of 3-Total Product Cordial Graphs

Abstract

In [ 3 ], Ponraj. R et al have defined the 3- Total Product Cordial of a graph G V, E as follows, Let f be a function from VG to{0, 1, ... k - 1}where k is an integer, 2 ≤ k ≤ VG . For each edge uv assign the label f u f v mod k. f is called a k - Total Product cordial labeling if f i − f j ≤ 1, i, j ∈ {0, 1, . .k - 1} where fx denotes the total number of vertices and edges labeled with xx = 0, 1, 2, ...., k-1. We prove that the 3-Total Product cordial labeling is a behaviour of Fn.