山西大学学报（自然科学版）2024，Vol.47Issue(5)：923-934,12.DOI:10.13451/j.sxu.ns.2023130
图的混合边邻域粘连度
Mixed Edge Neighbor Tenacity of Graphs
摘要
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分类
数理科学引用本文复制引用
闫伟,魏宗田..图的混合边邻域粘连度[J].山西大学学报（自然科学版）,2024,47(5):923-934,12.基金项目
国家自然科学基金(61902304) （61902304）
