【摘要】 当n≥ 3时 ,无向二元Kautz图UK(2 ,n)被证明是极大限制边连通的 .利用此结果确定了无向Kautz网络UK(2 ,n)的可靠多项式的前 3项系数 ,给出第 4项系数的一个下界 ,并且此下界是紧的更多还原

【Abstract】 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.更多还原