Triangular divisor cordial labeling for some special graphs

Let G=(V,E) be a (p,q)- graph. A Triangular divisor cordial labeling of a graph G with vertex set V is a bijectionf∶V→{T_1,T_2,T_3,….,T_p} where  T_i is the i^th Triangular number such that if each edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.If a graph has a  Triangular divisor cordial labeling, then it is called Triangular divisor cordial graph. In this paper, we proved the standard graphs such as C_4^((t)),K_(1,n)^+ ,F_m⨁K_(1,n)^+,C_n@K_(1,m),P_(4,n),B_(n,n)are Triangular divisor cordial graphs.