Staff Members - Benha University
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
Publication Information
Authors
E. M. Badr and B. Mohamed
Keywords
Entropy, Cyclic snakes, Total graph, Number of spanning trees
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
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