CORC  > 厦门大学  > 数学科学-已发表论文
On a kind of reliability analysis of networks
Guo, Litao ; Yang, Weihua ; Guo, Xiaofeng ; Guo XF(郭晓峰)
刊名http://dx.doi.org/10.1016/j.amc.2011.08.010
2011-11-15
关键词CONDITIONAL EDGE-CONNECTIVITY
英文摘要NSFC [10831001]; National Natural Science Foundation of China [11026055]; Fundamental Research Funds for the Central Universities, China [2010121076]; Science and Technology Planning Project of Fujian Province, China [2007H2002]; A network is often modeled by a graph G = (V, E). An edge set F subset of 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 lambda(3)(G) of G is the cardinality of a minimum 3-restricted edge cut of G. A graph G is lambda(3)-connected, if 3-restricted edge cuts exist. A graph G is called lambda(3)-optimal, if lambda(3)(G) = xi(3)(G), where xi(3)(G) = min{vertical bar[U, (U) over bar]vertical bar : U subset of V, vertical bar U vertical bar = 3 and G[U] is connected}. G[U] is the subgraph of G induced by the vertex subset U subset of V, and (U) over bar V\U is the complement of U.[U, (U) over bar] is the set of edges with one end in U and the other in (U) over bar. In this paper, we give some sufficient conditions for graphs to be lambda(3)-optimal. (C) 2011 Elsevier Inc. All rights reserved.
语种英语
内容类型期刊论文
源URL[http://dspace.xmu.edu.cn/handle/2288/66727]  
专题数学科学-已发表论文
推荐引用方式
GB/T 7714
Guo, Litao,Yang, Weihua,Guo, Xiaofeng,et al. On a kind of reliability analysis of networks[J]. http://dx.doi.org/10.1016/j.amc.2011.08.010,2011.
APA Guo, Litao,Yang, Weihua,Guo, Xiaofeng,&郭晓峰.(2011).On a kind of reliability analysis of networks.http://dx.doi.org/10.1016/j.amc.2011.08.010.
MLA Guo, Litao,et al."On a kind of reliability analysis of networks".http://dx.doi.org/10.1016/j.amc.2011.08.010 (2011).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace