NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
سال انتشار: 1392
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 54
فایل این مقاله در 15 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJOCE-4-1_007
تاریخ نمایه سازی: 5 آذر 1402
چکیده مقاله:
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.
کلیدواژه ها: