On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and su- cient condition for the tensor product of two or more graphs to be con- nected, bipartite or eulerian. Also, we present a characterization of the duplicate graph GK2 to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.