检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周婵婵[1] 林上为[1] Zhou Chanchan;Lin Shangwei(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,Shanxi China)
出 处:《河南科学》2017年第1期4-8,共5页Henan Science
基 金:国家自然科学基金(61202017);中国博士后基金(2012M510579)
摘 要:无向图的限制边连通度是度量网络可靠性的一个重要指标.为将该概念推广到有向图,人们提出限制弧连通度、强限制弧连通度以及圈弧连通度这三个概念.通过给出限制边连通度在有向图的又一推广—条件弧连通度,并讨论这四个推广之间的关系.Restricted edge connectivity of an undirected graph is an important measurement of the reliability in networks. To generalize the restricted edge connectivity to the digraphs,the concepts of restricted arc connectivity,strongly restricted arc connectivity and cyclic arc connectivity are introduced. In this paper,we introduce the concept of conditional arc connectivity,which is the another generalization of restricted edge connectivity to the digraphs,and also discuss the relationship between these four generalizations.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117