摘要
本文定义的循环有向图D(n;S)在分布式环形计算机互连网络设计中被广泛运用。本文证明了D(n;S)的强连通度k>2/3|S|。
For a fixed integer n■1 and the set S■{1,2,…,n-1), a circulant digraph D=D(n;S) with the set of vertex {0,1,2,…,n-1} is constructed as follows: ij is a direct edge of D if and only if j-i≡S(mod n) for some s∈S; In this note we prove that the strong connectivity of D(n; S) is greater than (2/3)l, where l=|S|.
出处
《应用数学》
CSCD
北大核心
1989年第3期1-4,共4页
Mathematica Applicata
基金
国家自然科学基金
