一类五正则小世界网络模型的生成树 数目的算法.pdfVIP

Pure Mathematics 理论数学, 2017, 7(5), 401-407 Published Online September 2017 in Hans. /journal/pm /10.12677/pm.2017.75052 Spanning Trees in a Class of Five Regular Small World Network Huanshen Jia, Tingzeng Wu Department of Mathematics, Qinghai Nationalities University, Xining Qinghai th nd th Received: Sep. 7 , 2017; accepted: Sep. 22 , 2017; published: Sep. 27 , 2017 Abstract Spanning trees are an important quantity characterizing the reliability of a network, however, ex- plicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we present a class of five regular network model with small world phenomenon, and in- troduce the concept and evolving process. We determine the relevant topological characteristics of the five regular network, such as diameter, clustering coefficient. We give a calculation method of number of spanning trees in such five regular network and derive the formulas and the entropy of number of spanning trees. We find that the entropy of spanning trees in the studied network is in sharp contrast to other small world with the same average degree, the entropy of which is less than the studied network. Thus, the number of spanning trees in such five regular network is more than that of other self-similar networks. Keywords Complex Network, Five Regular Network, Graph Theory, Spanning Tree 一类五正则小世界网络模型的生成树 数目的算法 贾环身，吴廷增 青海民族大学数学与统计学院，青海 西宁 收稿日期：2017年9月7 日；录用日期：2017年9月22 日；发布日期：2017年9月27 日 摘 要 生成树是表征网络结构性质的一个重要物理量，然而精确地确定网络上的生成树数目是一个巨大的理论 文章引用: 贾环身, 吴廷增. 一类五正则小世界网络模型的生成树数目的算法[J]. 理论数学, 2017, 7(5): 401-407. DOI: 10.12677/pm.2017.75052 贾环身，吴廷增