Abstract
The spanning tree entropy of a complex network provides a useful insight about its robustness. The most robust network is the network that has the highest entropy. In this paper, we represent construction of a complex network called Flower Network by using two combinatorial approaches: (1) Bipartition and (2) Reduction. We based both methods on geometrical transformation. We also develop topological properties of the network, obtain analytical expression for its number of spanning trees. In the end, we calculate and compare its spanning tree entropy with those for other networks having the same average degree of nodes for estimating a robust network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cook, A., Zanin, M.: Complex network theory. In: Complexity Science in Air Traffic Management, vol. 9 (2016)
Gao, J., et al.: Robustness of a network of networks. Phys. Rev. Lett. 107(19), 195701 (2011)
Sorkhoh, I., Mahdi, K., Safar, M.: Cyclic entropy of complex networks. In: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE (2012)
Lyons, R.: Asymptotic enumeration of spanning trees. Comb. Probab. Comput. 14(04), 491ā522 (2005)
Wu, B.Y., Chao, K.-M.: Spanning Trees and Optimization Problems. CRC Press, Boca Raton (2004)
Kirchhoff, G.: Ueber die Auflsung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Strme gefhrt wird. Annalen der Physik 148(12), 497ā508 (1847)
Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197, 143ā176 (1994)
Lin, Y., et al.: Counting spanning trees in self-similar networks by evaluating determinants. J. Math. Phys. 52(11), 113303 (2011)
Lotfi, D., Marraki, M.E., Aboutajdine, D.: The enumeration of spanning trees in dual, bipartite and reduced graphs. J. Discrete Math. Sci. Crypt. 18(6), 673ā687 (2015)
Zhang, Z., et al.: Mapping Koch curves into scale-free small-world networks. J. Phys. A Math. Theor. 43(39), 395101 (2010)
Zhang, Z., et al.: The number and degree distribution of spanning trees in the Tower of Hanoi graph. Theor. Comput. Sci. 609, 443ā455 (2016)
Wu, F.Y.: Number of spanning trees on a lattice. J. Phys. A Math. Gen. 10(6), L113 (1977)
Shrock, R., Fa Yueh, W.: Spanning trees on graphs and lattices in d dimensions. J. Phys. A Math. Gen. 33(21), 3881 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2017 Springer International Publishing AG
About this paper
Cite this paper
Mokhlissi, R., Lotfi, D., Debnath, J., ElĀ Marraki, M. (2017). An Innovative Combinatorial Approach for the Spanning Tree Entropy in Flower Network. In: El Abbadi, A., Garbinato, B. (eds) Networked Systems. NETYS 2017. Lecture Notes in Computer Science(), vol 10299. Springer, Cham. https://doi.org/10.1007/978-3-319-59647-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-59647-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59646-4
Online ISBN: 978-3-319-59647-1
eBook Packages: Computer ScienceComputer Science (R0)