References

Cancho, R.F.I., C. Janssen and R.V. Sole, 2001. Topology of technology graphs: Small world patterns in electronic circuits. Phys. Rev. E., 64: 046119-1-046119-5.
CrossRef  |  PubMed  |  Direct Link  |  

Chang, S.C., L.C. Chen and W.S. Yang, 2007. Spanning trees on the Sierpinski gasket. J. Stat. Phys., 126: 649-667.
CrossRef  |  Direct Link  |  

Colbourn, C.J., 1987. The Combinatorics of Network Reliability. Oxford University Press, Oxford, UK., ISBN:9780195049206, Pages: 160.

Daouad, S.N., 2013. Number of spanning trees of corona of some special graphs. Bull. Math. Sci. Appl., 1: 40-48.

Javari, A., M. Izadi and M. Jalili, 2016. Recommender Systems for Social Networks Analysis and Mining: Precision Versus Diversity. In: Complex Systems and Networks, Lu, J., X. Yu, G. Chen and W. Yu (Eds.). Springer, Berlin, Germany, ISBN:9783662478233, pp: 423-438.

Kirkhoff, G., 1847. [On the resolution of the equations, which are called for when investigating the linear distribution of galvanic currents (German)]. Ann. Phys. Chem., 148: 497-508.
CrossRef  |  Direct Link  |  

Liang, D., F. Li and Z. Xu, 2014. The number of spanning trees in a new lexicographic product of graphs. Sci. China Inf. Sci., 57: 1-9.
CrossRef  |  Direct Link  |  

Lotfi, D., M.E. Marraki and D. Aboutajdine, 2015. The enumeration of spanning trees in dual, bipartite and reduced graphs. J. Discrete Math. Sci. Cryptography, 18: 673-687.
CrossRef  |  Direct Link  |  

Lyons, R., 2005. Asymptotic enumeration of spanning trees. Combin. Probab. Comput., 14: 491-522.
CrossRef  |  Direct Link  |  

Myrvold, W., K.H. Cheung, L.B. Page and J.E. Perry, 1991. Uniformly‐most reliable networks do not always exist. Networks Intl. J., 21: 417-419.
CrossRef  |  Direct Link  |  

Newman, M., A.L. Barabasi and D.J. Watts, 2006. The Structure and Dynamics of Networks. Princeton University Press, Princeton, New Jersey, USA., ISBN-13:978-0-691-11356-2, Pages: 575.

Newman, M.E.J., 2003. The structure and function of complex networks. Soc. Ind. Applied Math. Rev., 45: 167-256.
CrossRef  |  

Nikolopoulos, S.D. and C. Papadopoulos, 2004. The number of spanning trees in K_n-complements of quasi-threshold graphs. Graphs Comb., 20: 383-397.
CrossRef  |  Direct Link  |  

Nishikawa, T. and A.E. Motter, 2006. Synchronization is optimal in nondiagonalizable networks. Phys. Rev. E, Vol. 73. 10.1103/PhysRevE.73.065106

Reggiani, A., P. Nijkamp and A. Cento, 2010. Connectivity and concentration in airline networks: A complexity analysis of lufthansas network. Eur. J. Inf. Syst., 19: 449-461.
CrossRef  |  Direct Link  |  

Shrock, R. and F.Y. Wu, 2000. Spanning trees on graphs and lattices in d dimensions. J. Phys. A: Math. Gen., 33: 881-3902.
CrossRef  |  Direct Link  |  

Teufl, E. and S. Wagner, 2011. Resistance scaling and the number of spanning trees in self-similar lattices. J. Stat. Phys., 142: 879-897.
CrossRef  |  Direct Link  |  

Wang, B., H. Tang, C. Guo and Z. Xiu, 2006. Entropy optimization of scale-free networks robustness to random failures. Phys. A. Stat. Mech. Appl., 363: 591-596.
CrossRef  |  Direct Link  |  

Wu, F.Y., 1977. Number of spanning trees on a lattice. J. Phys. A. Math. Gen., 10: L113-L115.
Direct Link  |  

Zhang, S., 2015. Network analysis, integration and methods in computational biology: A brief survey on recent advances. Complex Syst. Networks, 1: 459-482.
CrossRef  |  Direct Link  |