图的赋权边邻域坚韧度  

Weighted edge neighbor toughness of graphs

作　　者：李孟宣 魏宗田[1] LI Meng-xuan;WEI Zong-tian(School of Science,Xi’an University of Architecture and Technology,Xi’an 710055,China)

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

出　　处：《兰州理工大学学报》2025年第1期158-165,共8页Journal of Lanzhou University of Technology

基　　金：国家自然科学基金(61902304)。

摘　　要：将边邻域坚韧度推广到赋权图,提出图的赋权边邻域坚韧度概念.在给出一些基本图的赋权边邻域坚韧度的基础上,研究了几类图的赋权边邻域坚韧度的极值问题,给出圈的补图的赋权边邻域坚韧度最大值算法.研究表明,赋权边邻域坚韧度能更为精确地刻画某些网络的抗毁性.The edge neighbor toughness is generalized to the weighted graphs,and the concept of weighted edge neighbor toughness of a graph is proposed.After presenting the weighted edge neighbor toughness of some basic graphs,this paper focuses on the extreme problem of the weighted edge neighbor toughness of certain types of graphs,and designs an algorithm to compute the maximum weighted edge neighbor toughness of the complementary graph of cycles.The results show that the weighted edge neighbor toughness can accurately characterize the invulnerability of some networks.

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

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