Volume 10, Issue 1 (4-2015)                   IJMSI 2015, 10(1): 139-147 | Back to browse issues page

DOI: 10.7508/ijmsi.2015.01.011

XML Print

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
Type of Study: Research paper | Subject: General