أعضاء هيئة التدريس - جامعة بنها
E. M. Badr and B. Mohamed (2018), A Combinatorial Approach for the Spanning Tree Entropy in Complex Network,International Journal of Mathematical Combinatorics, International J.Math. Combin. Vol.4(2018), 1-17[ ISI Indexed: Impact Factor 1.743]
International journal of Mathematical Combinatorics • 2019
معلومات البحث
المؤلفون
E. M. Badr and B. Mohamed
الكلمات المفتاحية
Entropy, Cyclic snakes, Total graph, Number of spanning trees
المجلة العلمية
International journal of Mathematical Combinatorics
الناشر
Not Available
المجلد
Not Available
العدد
Not Available
الصفحات
Not Available
publication.type
International
رابط البحث
Not Available
المواد المرفقة
Not Available
الملخص
Abstract
The goal of this paper is to propose the combinatorial method to facilitate the
calculation of the number of spanning trees for complex networks. In particular, we
derive the explicit formulas for the triangular snake, double triangular snake, four
triangular snake, the total graph of path, the generalized friendship graphs and the
subdivision of double triangular snake. Finally, we calculate their spanning trees
entropy and we compare it between them
The goal of this paper is to propose the combinatorial method to facilitate the
calculation of the number of spanning trees for complex networks. In particular, we
derive the explicit formulas for the triangular snake, double triangular snake, four
triangular snake, the total graph of path, the generalized friendship graphs and the
subdivision of double triangular snake. Finally, we calculate their spanning trees
entropy and we compare it between them