当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Vulnerability of super extra edge-connected graphs
Journal of Computer and System Sciences ( IF 1.129 ) Pub Date : 2019-07-30 , DOI: 10.1016/j.jcss.2019.07.002
Chia-Wen Cheng; Sun-Yuan Hsieh; Ralf Klasing

Edge connectivity is a crucial measure of the robustness of a network. Several edge connectivity variants have been proposed for measuring the reliability and fault tolerance of networks under various conditions. Let G be a connected graph, S be a subset of edges in G, and k be a positive integer. If G−S is disconnected and every component has at least k vertices, then S is a k-extra edge-cut of G. The k-extra edge-connectivity, denoted by λk(G), is the minimum cardinality over all k-extra edge-cuts of G. If λk(G) exists and at least one component of G−S contains exactly k vertices for any minimum k-extra edge-cut S, then G is super-λk. Moreover, when G is super-λk, the persistence of G, denoted by ρk(G), is the maximum integer m for which G−F is still super-λk for any set F⊆E(G) with |F|≤m. Previously, bounds of ρk(G) were provided only for k∈{1,2}. This study provides the bounds of ρk(G) for k≥2.
更新日期:2020-01-04

 

全部期刊列表>>
全球疫情及响应:BMC Medicine专题征稿
欢迎探索2019年最具下载量的化学论文
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
南方科技大学
x-mol收录
南方科技大学
自然科研论文编辑服务
上海交通大学彭文杰
中国科学院长春应化所于聪-4-8
武汉工程大学
课题组网站
X-MOL
深圳大学二维材料实验室张晗
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug