图的弱毁裂度  

The weak rupture degree of graphs

作　　者：魏宗田[1] 岳超 刘勇[1] 李银奎[2] 杨静婷 

机构地区：[1]西安建筑科技大学理学院,陕西西安710055 [2]青海民族大学数学与统计学院,青海西宁810000

出　　处：《西北大学学报（自然科学版）》2017年第6期801-805,共5页Journal of Northwest University（Natural Science Edition）

基　　金：国家自然科学基金资助项目(11661066);陕西省自然科学基金资助项目(2016JM1035)

摘　　要：为了刻画具有相同毁裂度的图在抗毁性上的差异,引入一个新的网络抗毁性参数—弱毁裂度。运用组合优化和类比分析方法研究并给出了若干具有特殊结构图的弱毁裂度计算公式以及一般图的弱毁裂度上、下界。几类典型图的抗毁性分析表明,该参数具有比毁裂度更高的精确性。In order to measure the difference on invulnerability between graphs with equal rupture degree,a new network invulnerability parameter called weak rupture degree is introduced. By using the methods of combinatorial optimization and comparison analysis,the formula of some special graphs and the upper and lower bounds of general graphs for the weak rupture degree are given. The relationships between this parameter and the invulnerability of graphs are further discussed. It is shown that the weak rupture degree is more precise than rupture degree through the invulnerability analysis of several types of graph.

关 键 词：图 网络 弱毁裂度 毁裂度 抗毁性 

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