TY - JOUR
T1 - On Tensor Product of Graphs, Girth and Triangles
TT -
JF - IJMSI
JO - IJMSI
VL - 10
IS - 1
UR - http://ijmsi.ir/article-1-581-en.html
Y1 - 2015
SP - 139
EP - 147
KW - Tensor product
KW - Bipartite graph
KW - Connected graph
KW - Eulerian graph
KW - Girth
KW - Cycle
KW - Path.
N2 - 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.
M3 10.7508/ijmsi.2015.01.011
ER -