In this paper we investigate a now labeling called 3-total super product cordial labeling. Suppose ???? = (????(????),????(????) be graph with vertex set ????(????) and edge set ????(????). A vertex labeling ????. ????(????) → {0,1,2}. For each edge wv assign the label (????(????) ∗????(????))???? 3. The map ???? is called a 3-total super product cordial labeling if |????(????) − ????(0)| ≤ 1 for ????,????????{0,1,2} where ????(????) denotes the total number vertices and edges labeled with ???? = {0,1,2} and for each edge ????????,[????(????) − ????(????) ≤ 1. Any graph which satisfies 3-total super product cord labeling is called 3-total super product cordial graphs. Here we prove some graphs like path; cycle and complete bipartite graph ????????, ???? a 3-total super product cordial graphs.