کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6898943 1446437 2017 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Complexity of graphs generated by wheel graph and their asymptotic limits
ترجمه فارسی عنوان
پیچیدگی گراف های تولید شده توسط گراف چرخ و محدودیت های آستانه ی آنها
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی
The literature is very rich with works deal with the enumerating the spanning trees in any graph G since the pioneer Kirchhoff (1847). Generally, the number of spanning trees in a graph can be acquired by directly calculating an associated determinant corresponding to the graph. However, for a large graph, evaluating the pertinent determinant is ungovernable. In this paper, we introduce a new technique for calculating the number of spanning trees which avoids the strenuous computation of the determinant for calculating the number of spanning trees. Using this technique, we can obtain the number of spanning trees of any graph generated by the wheel graph. Finally, we give the numerical result of asymptotic growth constant of the spanning trees of studied graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of the Egyptian Mathematical Society - Volume 25, Issue 4, October 2017, Pages 424-433
نویسندگان
,