图的混合边邻域粘连度
Mixed Edge Neighbor Tenacity of Graphs
闫伟 1魏宗田1
作者信息
- 1. 西安建筑科技大学 理学院,陕西 西安 710055
- 折叠
摘要
为了定量刻画边失效情形下的网络抗毁性,提出图的混合边邻域粘连度概念.给出了几类图的参数计算公式和最好可能的上、下界,用组合优化方法研究了该参数的极值问题.通过比较几类边邻域抗毁性参数的区分度,指出混合边邻域粘连度刻画某些网络的抗毁性更为精确.
Abstract
In order to quantitatively characterize the network invulnerability in the case of edge failure,the concept of mixed edge neighbor tenacity was proposed.The parameter calculation formulas of several types of graphs and the best possible upper and lower bounds were given,and the extreme value problem of this parameter was studied by combinatorial optimization method.By compar-ing the discrimination degrees of several types of edge neighbor invulnerability parameters,it is shown that the mixed edge neighbor tenacity is more accurate to characterize the invulnerability of some networks.
关键词
图/网络抗毁性/混合边邻域粘连度/界/极值图Key words
graph/network invulnerability/mixed edge neighbor tenacity/bound/extreme graph引用本文复制引用
出版年
2024
国家科技期刊平台
NSTL
万方数据