| You are in:Home/Publications/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] | |
Prof. Alsayed alsayed mitwali badr :: Publications: |
|
| Title: | 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] |
| Authors: | E. M. Badr and B. Mohamed |
| Year: | 2019 |
| Keywords: | Entropy, Cyclic snakes, Total graph, Number of spanning trees |
| 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 | Not Available |
| Supplementary materials | Not Available |
| Abstract: |
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 |
