图的广义p-邻域完整度  

General p-neighbor integrity of graphs

作　　者：崔晨 魏宗田[1] CUI Chen;WEI Zong-tian(Department of Mathematics,Xi'an University of Architecture and Technology,Xi'an 710055,Shaanxi,China)

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

出　　处：《山东大学学报（理学版）》2022年第10期72-78,共7页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(61902304)。

摘　　要：当网络中一个节点失效后,邻点受其影响也以某个概率p失效。基于此,提出图的广义p-邻域完整度的概念,将完整度与邻域完整度统一起来。通过参数值的计算、与失效概率p的关系分析以及若干同阶图的比较,表明该参数能够更精确地度量网络抗毁性。In networks, a failed vertex will lead to its neighborhood fail with a certain probability p. Based on this, the concept of general p-neighbor integrity of graphs is proposed, and therefore the concept of integrity and neighbor integrity are unified by the failure probability. Through the parameter calculation of parameter values, the analysis of the relationship with failure probability p and the parameter value comparison of several graphs with the same order, it is shown that this parameter can measure network invulnerability more accurately.

关 键 词：网络抗毁性 完整度 邻域完整度 失效概率 广义p-邻域完整度 

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