摘要
限制边连通度是比传统的边连通度更精确的网络可靠性指标.限制边连通度在有向图中有4个推广,分别对应有向图的4种限制弧连通度.有向Kautz图可以作为多处理机系统的基础拓扑,是一类重要网络.证明了有向Kautz图K(d,n)的4种限制弧连通度都为2d-2,并且确定了对应的最小限制弧割的结构特征.
Restricted edge-connectivity is a more refined network reliability index than traditional edge-connectivity. There are four generalizations of restricted edge-connectivity to digraphs, which correspond to four kinds of restricted arc-connectivity. Kautz digraphs are a kind of important networks, which can be used as the basic topology of multiprocessor systems. In this paper, the four kinds of restricted arc-connectivity of Kautz digraphs are all proved to be 2d-2 and the structural characteristics of the corresponding minimum restricted arc-cuts are also illustrated.
作者
林上为
原牡丹
李春芳
LIN Shang-wei;YUAN Mu-dan;LI Chun-fang(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)
出处
《云南民族大学学报(自然科学版)》
CAS
2022年第5期558-562,共5页
Journal of Yunnan Minzu University:Natural Sciences Edition
基金
国家自然科学基金(11701349)。
关键词
网络
可靠性
Kautz图
边连通度
限制弧连通度
network
reliability
Kautz digraph
edge-connectivity
restricted arc-connectivity