Abstract
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 G K2 to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Iranian Journal of Mathematical Sciences and Informatics
Paper Title
Journal
Date
