节点文献

图的弱毁裂度

The weak rupture degree of graphs

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 魏宗田岳超刘勇李银奎杨静婷

【Author】 WEI Zongtian;YUE Chao;LIU Yong;LI Yinkui;YANG Jingting;Department of Mathematics,Xi’an University of Architecture and Technology;School of Mathematics and Statistics,Qinghai Nationalities University;

【机构】 西安建筑科技大学理学院青海民族大学数学与统计学院

【摘要】 为了刻画具有相同毁裂度的图在抗毁性上的差异,引入一个新的网络抗毁性参数—弱毁裂度。运用组合优化和类比分析方法研究并给出了若干具有特殊结构图的弱毁裂度计算公式以及一般图的弱毁裂度上、下界。几类典型图的抗毁性分析表明,该参数具有比毁裂度更高的精确性。

【Abstract】 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.

【关键词】 网络弱毁裂度毁裂度抗毁性
【Key words】 graphnetworkweak rupture degreerupture degreeinvulnerability
【基金】 国家自然科学基金资助项目(11661066);陕西省自然科学基金资助项目(2016JM1035)
  • 【文献出处】 西北大学学报(自然科学版) ,Journal of Northwest University(Natural Science Edition) , 编辑部邮箱 ,2017年06期
  • 【分类号】O157.5
  • 【被引频次】6
  • 【下载频次】80
节点文献中: