Staff Members - Benha University
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
Publication Information
Authors
E. M. Badr and B. Mohamed
Keywords
Number of spanning trees, Cyclic snakes networks, Entropy
Journal
International Journal of Mathematical Combinatorics
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
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.