简谈连通无向广义DeBruijn图m-限制边连通性

论文导读：B_G(3,n)17-253.1Structureproperty17-223.2Restrictededgeconnectivity22-254RestrictededgeconnectivityofUB_G(d,n)25-294.1Structureproperty25-284.2Maximalrestrictededgeconnectivity28-29References29-33附录33-35致谢35
摘要：广义De bruijn网络弥补了De Bruijn网络的不足,可以任意数量的节点,本论文探讨它的边连通性。图的边连通度是度量远程通信网络可靠性的重要参数,但对于有相同数量节点和信道的极大边连通网络,图的边连通度却不能用来比较它们的可靠性。为了解决上面陈述的不足,人们提出了m-限制边连通度的概念。已有的探讨结果表明,具有较大m-制边连通度的远程通信部更可靠,其中m≤3。本论文探讨了无向广义De Bruijn网络拓扑的m限制边连通性,得到下列结果：定理2.2.1.当n≥7时,无向广义De Bruijn图UBG(2,n)是极大2-限制边连通的。定理2.2.2.当n≥7时,无向广义De Bruijn图UBG(2,n)是极大3-限制边连通的。定理3.2.1.当n25时,无向广义De Bruijn图UBG(3,n)的限制边连通度为6≤λ’≤8；当9≤n≤24时,6≤λ≤7。定理4.2.1.当nd(d2-1)且d≥4时,无向广义De Bruijn图UBG(d,n)是极大限制边连通的。这些结果可用于浅析拓扑结构是广义De Bruijn图的远程通信网络的可靠性,并提升其计算精度。关键词：广义De论文Bruijn图论文m-限制边连通度论文网络可靠性论文
本论文由www.7ctime.com,需要论文可以联系人员哦。摘要4-5
Abstract5-7
1 Graph-theoretic symbols and terminology7-11
1.1 Restricted edge connectivity of graphs7
1.2 Repabipty of telecommunication networks7-8

1.3 Generapzed De Bruijn graphs8-11

2 Maximal restricted edge connectivity of UB_G(2, n)11-17

2.1 Structure property11-15

2.2 Restricted edge connectivity15-17

3 Restricted edge connectivity of UB_G(3,n)17-25

3.1 Structure property17-22

3.2 Restricted edge connectivity22-25

4 Restricted edge connectivity of UB_G(d, n)25-29

4.1 Structure property25-28

4.2 Maximal restricted edge connectivity28-29
References29-33
附录33-35
致谢35