节点文献
一类无向Kautz图的k限制边连通度的上界
The Upper Bound on k-Restricted Edge Connectivity of a Class of Kautz Graphs
【摘要】 在Moor-Shannon网络模型中,k限制边连通度较大的网络一般有较好的可靠性和容错性.本文在无向Kautz图UK(2,n)中研究k限制边连通度的上界ξk,证明了ξ5(UK(2,3))=6,ξ5(UK(2,n)) =8,n≥4,且当4≤k≤n时,ξk(UK(2,n))≤2(k-「k/3」).
【Abstract】 For Moor-Shannon network models,the greater the k-restricted edge connectivity is,the better the reliability and fault-tolerance is.In this paper,we study the upper boundξk of the k-restricted edge connectivity in the undirected Kautz graph UK(2,n)and show thatξ5(UK(2,3))=6,ξ5(UK(2,n))=8 for n≥4,andξk(UK(2,n))≤2(k-「k/3」) for 4≤k≤n.
【关键词】 Kautz图;
边连通度;
限制边连通度;
【Key words】 Kautz graphs; edge connectivity; restricted edge connectivity;
【Key words】 Kautz graphs; edge connectivity; restricted edge connectivity;
【基金】 国家自然科学基金(60773131);山西省自然科学基金(2008011010);山西省研究生优秀创新基金(20081026)资助项目.
- 【文献出处】 应用数学学报 ,Acta Mathematicae Applicatae Sinica , 编辑部邮箱 ,2009年02期
- 【分类号】O157.5
- 【被引频次】1
- 【下载频次】108