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


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Rahami H, Kaveh A. NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS. International Journal of Optimization in Civil Engineering. 2014; 4 (1) :121-135
URL: http://ijoce.iust.ac.ir/article-1-166-fa.html
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS. دانشگاه علم و صنعت ایران. 1392; 4 (1) :121-135

URL: http://ijoce.iust.ac.ir/article-1-166-fa.html


چکیده:   (2071 مشاهده)
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]   (1162 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Applications
دریافت: ۱۳۹۳/۱/۲۲ | پذیرش: ۱۳۹۳/۱/۲۲ | انتشار: ۱۳۹۳/۱/۲۲

کلیه حقوق این وب سایت متعلق به دانشگاه علم و صنعت ایران می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb