دوره 4، شماره 1 - ( 12-1392 )                   جلد 4 شماره 1 صفحات 121-135 | برگشت به فهرست نسخه ها

XML English Abstract Print


چکیده:   (3970 مشاهده)
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was not possible, first their Laplacian matrices are transformed into single block diagonal forms and then using the concept of determinant, the calculations are performed.
متن کامل [PDF 397 kb]   (1963 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Applications
دریافت: ۱۳۹۳/۱/۲۲ | پذیرش: ۱۳۹۳/۱/۲۲ | انتشار: ۱۳۹۳/۱/۲۲