循环图Cn<1,k,n/2>的连通度

The Connectiviy of a Class of Circulants

一方面利用 Ｅｕｌｅｒ 定理证明了循环 Ｃｎ ＜ １ ，ｋ ，ｎ／２ ＞ 的连通度不超过其最小度５ ；另一方面，在 Ｃｎ ＜ １ ，ｋ ，ｎ／２ ＞ 中任意删去４ 个顶点后，证明剩余图仍然连通，从而说明其连通度不小于５ ．从以上两方面证明可知， Ｃｎ ＜ １ ，ｋ ，ｎ／２ ＞

The connectivities of the circulants C n<1,k,n/2> are deterimed to be 5,which their connectivities are, on ane hand, less than or equal to the minimum degree 5 according to the Euler theorem,on the other hand greater than or equal to 5 by removing arbitary four rertex from C n<1,k,n/2> and proving the rese graphs still connecting.