图的赋权邻域坚韧度  

Weighted neighbor toughness of graphs

作　　者：翁婷婷 魏宗田[1] WENG Ting-ting;WEI Zong-tian(Department of Mathematics,Xi'an University of Architecture and Technology,Xi'an 710055,Shaanxi,China)

机构地区：[1]西安建筑科技大学理学院,陕西西安710055

出　　处：《山东大学学报（理学版）》2022年第6期36-43,共8页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(1661066);陕西省自然科学基金资助项目(2016JM1035);青海省自然科学基金资助项目(2017-ZJ-701)。

摘　　要：将邻域坚韧度引入赋权图中,提出图的赋权邻域坚韧度概念。在给出一些基本图的赋权邻域坚韧度的基础上,着重研究几类图的赋权邻域坚韧度的极值问题。结果表明,参数值与图的结构、权值大小和赋权方式均有关系,因而能更为准确地刻画网络的抗毁性。Introduced neighbor toughness into the weighted graph, and the concept of weighted neighbor toughness of the graph is proposed. On the basis of giving some basic graphs’ weighted neighbor toughness, the extreme value problem of weighted neighbor toughness of several types of graphs was focused. The results show that the parameter values are related to the structure of the graph, the size of the weights, and the way of weighting, so the invulnerability of the network can be described more accurately.

关 键 词：网络抗毁性 赋权图 赋权邻域坚韧度 坚韧度 

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