摘要
当n≥ 3时 ,无向二元Kautz图UK(2 ,n)被证明是极大限制边连通的 .利用此结果确定了无向Kautz网络UK(2 ,n)的可靠多项式的前 3项系数 ,给出第 4项系数的一个下界 。
Undirected binary Kautz graph UK(2,n) is proved to be maximal restricted edge connected when (n≥ 3).With this result,the first three coefficients of the reliability polynomial of Kautz network UK(2,n)and a lower bound on the fourth coefficient are determined,and the lower bound is sharp.
出处
《内蒙古师范大学学报(自然科学汉文版)》
CAS
2004年第4期353-356,共4页
Journal of Inner Mongolia Normal University(Natural Science Edition)
基金
ProjectSupportedbyNationalNaturalScienceFoundationofChina (10 2 7110 5 )
FoundationofEducationMinistryofFujian(JA0 3 14 7)
FoundationofScienceandTechnologyMinistryofFujian (2 0 0 3J0 3 6)