دوره 4، شماره 1 - ( 12-1392 )
جلد 4 شماره 1 صفحات 135-121 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Rahami H, Kaveh A. NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS. IJOCE 2014; 4 (1) :121-135
URL: http://ijoce.iust.ac.ir/article-1-166-fa.html
URL: http://ijoce.iust.ac.ir/article-1-166-fa.html
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS. عنوان نشریه. 1392; 4 (1) :121-135
چکیده: (22679 مشاهده)
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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
Applications
دریافت: 1393/1/22 | پذیرش: 1393/1/22 | انتشار: 1393/1/22
دریافت: 1393/1/22 | پذیرش: 1393/1/22 | انتشار: 1393/1/22
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
