Let G = (V, E) be a simple connected graph of order p and size q. If {G₁,G₂,……...,G_n} are edge disjoint subgraphs of G such that E(G) = E(G₁)  E(G₂) ………... E(G_n) then  {G₁,G₂,…....,G_n} is said to be a Decomposition of a graph G. A graph of size q =  is said to have a Triangular decomposition (TD) if G can be decomposed into n - subgraphs {G₁,G₂,…..,G_n}such that each  subgraphs G_i is connected and  =   for 1 .  In this paper we investigate Triangular decomposition of Tensor product of simple graphs.