| publication name | 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] |
|---|---|
| Authors | E. M. Badr and B. Mohamed |
| year | 2017 |
| keywords | Number of spanning trees, Cyclic snakes networks, Entropy |
| journal | International Journal of Mathematical Combinatorics |
| volume | Not Available |
| issue | Not Available |
| pages | Not Available |
| publisher | Not Available |
| Local/International | International |
| Paper Link | Not Available |
| Full paper | download |
| 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.