أعضاء هيئة التدريس - جامعة بنها
E. M. Badr and B. Mohamed (2017), Complexity of Linear and General Cyclic Snake Networks,International Journal of Mathematical Combinatorics, Vol.3(2017), 57-70 [ ISI Indexed: Impact Factor 1.743]
International Journal of Mathematical Combinatorics • 2017
معلومات البحث
المؤلفون
E. M. Badr and B. Mohamed
الكلمات المفتاحية
Number of spanning trees, Cyclic snakes networks, Entropy
المجلة العلمية
International Journal of Mathematical Combinatorics
الناشر
Not Available
المجلد
Not Available
العدد
Not Available
الصفحات
Not Available
publication.type
International
رابط البحث
Not Available
المواد المرفقة
Not Available
الملخص
Abstract
In this paper we prove that the number of spanning trees of the linear and general cyclic snake networks is the same using the combinatorial approach. We derive the explicit formulas for the subdivided fan network and the subdivided ladder graph . Finally, we calculate their spanning trees entropy and compare it between them.
Abstract
In this paper we prove that the number of spanning trees of the linear and general cyclic snake networks is the same using the combinatorial approach. We derive the explicit formulas for the subdivided fan network and the subdivided ladder graph . Finally, we calculate their spanning trees entropy and compare it between them.
In this paper we prove that the number of spanning trees of the linear and general cyclic snake networks is the same using the combinatorial approach. We derive the explicit formulas for the subdivided fan network and the subdivided ladder graph . Finally, we calculate their spanning trees entropy and compare it between them.
Abstract
In this paper we prove that the number of spanning trees of the linear and general cyclic snake networks is the same using the combinatorial approach. We derive the explicit formulas for the subdivided fan network and the subdivided ladder graph . Finally, we calculate their spanning trees entropy and compare it between them.