链路意义下网络抗毁性的一种新刻画  

A New Measure for Vulnerability of Network on Links

作　　者：王青宁[1] 李银奎[1] WANG Qing-ning;LI Yin-kui(School of Mathematics and Statistics,Qinghai Nationalities University,Xining 810007,China)

机构地区：[1]青海民族大学数学与统计学院

出　　处：《西南师范大学学报（自然科学版）》2019年第8期28-33,共6页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：国家自然科学基金项目(11661066,11561056);青海省基础应用研究项目(2017-ZJ-701,2016-ZJ-914);青海民族大学自然科学基金项目(2018XJY02,2019XJG10)

摘　　要：随着元器件性能的大幅提高,网络故障多因链路受阻或破坏所引发,为了更好地刻画和分析网络抗毁性,从链路角度引入新的连通性参数——图的边毁裂度.运用组合优化和类比分析方法研究并给出了若干具有特殊结构的图的边毁裂度的计算公式和一般图的边毁裂度的界,同时讨论了图的边毁裂度与其它参数的关系,并举例表明结果是最好的.With the rapid improvement of the performance of components, network failures are mostly caused by the blocking or breaking of links. In order to better characterize and analyze the network's anti-destructive performance, a new connectivity parameter has been introduced: edge rupture degree of graphs aspect to the link of networks. Using combinatorial optimization and analogy analysis methods, the calculation formulas of edge rupture degree of some special structural graphs and the bounds of edge rupture degree for general graphs are given. At the same time, the relationship between edge rupture degree of graph and other parameters is discussed, and examples show that the results are best possible.

关 键 词：边毁裂度 单圈图 双圈图 完全图 网络抗毁性 

分 类 号：O157.6[理学—数学]