دوره 10، شماره 1 - ( 1-1394 )                   جلد 10 شماره 1 صفحات 139-147 | برگشت به فهرست نسخه ها

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.
نوع مطالعه: پژوهشي | موضوع مقاله: عمومى