无向de-Bruijn图的超级边连通性和限制性边连通度

吕长虹, 张克民

应用数学学报 ›› 2002, Vol. 25 ›› Issue (1) : 29-35.

PDF(425 KB)
PDF(425 KB)
应用数学学报 ›› 2002, Vol. 25 ›› Issue (1) : 29-35. DOI: 10.12387/C2002006
论文

无向de-Bruijn图的超级边连通性和限制性边连通度

    吕长虹(1),张克民(2)
作者信息 +

SUPER CONNECTIVITY AND RESTRCTED CONNECTIVITY OF UNDIRECTED DE BRUIJN GRAPHS

    Chang Hong LV(1), Ke Min ZHANG(2)
Author information +
文章历史 +

摘要

super-λ和限制性边连通度是两个比边连通度更能刻画网络可行性的参数。本文证明了无向无向de-Bruijn图UB(d,n)是super-λ(d≥2,n≥2)。对n≥4,我们证明了UB(2,n)的限制性边连通度为4;UB(2,3)的限制性边连通度是3。对d≥3我们指出UB(d,n)(n≥3)的限制性连连通度λ’,满足2d-2λ’≤4d-4.

Abstract

Super-λ and restrcted connectivity are more refined network reliability indexes than edge-connectivity. In this work, we proved: (1) UB(d,n) is super-λ (d ≥ 2, n ≥ 2); (2) The restrcted connectivity of UB (2,n) is 4 for n ≥4, and it is 3 for UB (2,3). When d ≥ 3, 2d-2 < λ' (UB(d,n)) ≤ 4d-4.

关键词

de-Bruijn图

Key words

超级边连通

引用本文

导出引用
吕长虹, 张克民. 无向de-Bruijn图的超级边连通性和限制性边连通度. 应用数学学报, 2002, 25(1): 29-35 https://doi.org/10.12387/C2002006
Chang Hong LV, Ke Min ZHANG. SUPER CONNECTIVITY AND RESTRCTED CONNECTIVITY OF UNDIRECTED DE BRUIJN GRAPHS. Acta Mathematicae Applicatae Sinica, 2002, 25(1): 29-35 https://doi.org/10.12387/C2002006
PDF(425 KB)

194

Accesses

0

Citation

Detail

段落导航
相关文章

/