图的赋权边邻域完整度  

Weighted Edge Neighbor Integrity of Graphs

作　　者：李孟宣 魏宗田[1] LI Mengxuan;WEI Zongtian(Department of Mathematics,Xi’an University of Architecture and Technology,Xi’an 710055,China)

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

出　　处：《西北民族大学学报（自然科学版）》2024年第4期1-11,30,共12页Journal of Northwest Minzu University(Natural Science)

摘　　要：为了精确刻画边失效情形下的网络抗毁性,文章提出赋权边邻域完整度概念,并研究了直径不超过4的树的参数值计算和几类典型组合图的最小值问题,在此基础上讨论赋权边邻域完整度与图结构、赋权方式,以及权值大小的关系.In order to accurately measure networks invulnerability under edge failure situation,the concept weighted edge neighbor integrity was proposed.The calculation of the parameter values of trees with diameter at maximum 4 and the minimum problem of several typical combination graphs were studied in the present article.Based on this,the relationship between weighted edge neighbor integrity and graph structure,weighting manor,and weight value were also discussed.

关 键 词：网络抗毁性 赋权图 边失效 赋权边邻域完整度 

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