RT - Journal Article
T1 - On Tensor Product of Graphs, Girth and Triangles
JF - IJMSI
YR - 2015
JO - IJMSI
VO - 10
IS - 1
UR - http://ijmsi.ir/article-1-581-en.html
SP - 139
EP - 147
K1 - Tensor product
K1 - Bipartite graph
K1 - Connected graph
K1 - Eulerian graph
K1 - Girth
K1 - Cycle
K1 - Path.
AB - 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.
LA eng
UL http://ijmsi.ir/article-1-581-en.html
M3 10.7508/ijmsi.2015.01.011
ER -