论文部分内容阅读
In this paper, we prove that almost all circulant digraphs are strongly connected. Furthermore, for any given positive integer m, we show that almost every circulant digraph C has connectivity at least m/1+m(d(C)+1), where d(C) is the vertex degree of C.