On a kind of reliability analysis of networks
On a kind of reliability analysis of networks
复制标题
一种网络可靠性分析
DOI：
10.1016/j.amc.2011.08.010
复制
发表时间：
2011-11
影响因子：
4
通讯作者：
Guo, Xiaofeng
中科院分区：
文献类型：
--
作者：
Guo, Litao;Yang, Weihua;Guo, Xiaofeng
A network is often modeled by a graph G=(V,E). An edge set F⊂E is a 3-restricted edge cut, if G−F is disconnected and every component of G−F has at least three vertices. The 3-restricted edge connectivity λ3(G) of G is the cardinality of a minimum 3-restricted edge cut of G. A graph G is λ3-connected, if 3-restricted edge cuts exist. A graph G is called λ3-optimal, if λ3(G)=ξ3(G), whereG[U] is the subgraph of G induced by the vertex subset U⊆V, and U¯=V⧹U is the complement of U·[U,U¯] is the set of edges with one end in U and the other in U¯. In this paper, we give some sufficient conditions for graphs to be λ3-optimal.
登录
查看更多内容
DOI：
10.1016/s0012-365x(02)00299-6
发表时间：
2002-12
期刊：
Discret. Math.
影响因子：
--
作者：
Ming Wang;Qiao Li
通讯作者：
Ming Wang;Qiao Li
DOI：
10.1016/s0012-365x(02)00385-0
发表时间：
2002-09
期刊：
Discret. Math.
影响因子：
--
作者：
P. Bonsma;Nicola Ueffing;L. Volkmann
通讯作者：
P. Bonsma;Nicola Ueffing;L. Volkmann
DOI：
--
发表时间：
1987
期刊：
--
影响因子：
--
作者：
C. Colbourn
通讯作者：
C. Colbourn
影响因子：
0.5
作者：
ESFAHANIAN, AH;HAKIMI, SL
通讯作者：
HAKIMI, SL