摘要
设G＝Cn（i1，i2，…，ir）是连通循环圈，且k（G）＜δ（G）．本文得到了其连通度的明确表达式。 ：m是n的真因子，且 ．
In this paper, an explicit expression is derived for the connectivity of a connected circulant graph whose connectivity is less than its point degree, that is k(G) = :m is a proper divisor of n and.
关键词
循环圈
连通度
原子部分
circulant graph
connectivity
atomic part
