图的顶点赋权邻域粘连度  

Vertex weighted neighbor tenacity of graphs

作　　者：师铭 魏宗田[1] 刘勇[1] 翁婷婷 SHI Ming;WEI Zong-tian;LIU Yong;WENG Ting-ting(School of Science,Xi'an University of Architecture and Technology,Xi'an 710055,Shaanxi,China)

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

出　　处：《山东大学学报（理学版）》2021年第5期26-32,共7页Journal of Shandong University(Natural Science)

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

摘　　要：将邻域抗毁性该参数推广到顶点赋权图中,提出图的顶点赋权邻域粘连度概念。通过构造组合星图,建立数学规划模型,研究了几类图的顶点赋权邻域粘连度的极值问题。The neighbor invulnerability parameter is generalized to weighted graphs,and a new concept,vertex weighted neighbor tenacity,is proposed.By constructing two types of composite star graphs,several extreme graphs under vertex weighted neighbor tenacity are studied by using mathematical modeling methods.

关 键 词：网络抗毁性 顶点赋权图 顶点赋权邻域粘连度 邻域粘连度 

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