On Tensor Product of Graphs, Girth and Triangles

Author(s):

H. P. Patil , V. Raja

Message:
Abstract:
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.
Keywords:

Tensor product , Bipartite graph , Connected graph , Eulerian graph , Girth , Cycle , Path

Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:10 Issue: 1, May 2015
Pages:
139 to 147
https://www.magiran.com/p1401964