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

Computer Science and Application 计算机科学与应用, 2014, 4, 43-49 Published Online March 2014 in Hans. /journal/csa /10.12677/csa.2014.43009 Spanning Trees in a Class of Four Regular Small World Network 1 2 Huanshen Jia , Haixing Zhao 1 Department of Mathematics, Qinghai Normal University, Xining 2 Department of Computer Science, Qinghai Normal University, Xining Email: jhs1989@163.com, h.x.zhao@163.com st th th Received: Jan. 31 , 2014; revised: Feb. 26 , 2014; accepted: Mar. 10 , 2014 Copyright © 2014 by authors and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Abstract Spanning tree is an important quantity characterizing the reliability of a network; however, expli- citly determining the number of spanning trees in networks is a theoretical challenge. In this pa- per, we present a class of four regular network model with small world phenomenon. We intro- duce the concept and evolving process and determine the relevant topological characteristics of the four regular network, such as diameter and clustering coefficient. We give a calculation me- thod of number of spanning trees in such four 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, of which the en- tropy is less than the studied network. Thus, the number of spanning trees in such four regular network is more than that of other self-similar networks.