JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2022, Vol. 57 ›› Issue (10): 72-78.doi: 10.6040/j.issn.1671-9352.0.2021.445

Previous Articles    

General p-neighbor integrity of graphs

CUI Chen, WEI Zong-tian   

  1. Department of Mathematics, Xian University of Architecture and Technology, Xian 710055, Shaanxi, China
  • Published:2022-10-06

PDF (PC)

143

Abstract: 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.

Key words: network invulnerability, integrity, vertex-neighbor integrity, failure probability, general p-neighbor integrity

CLC Number: 

  • O157.5
[1] JUNG H A. On a class of posets and the corresponding comparability graphs[J]. Journal of Combinatorial Theory. Series B, 1978, 24(2):125-133.
[2] BAREFOOT C A, ENTRINGER R, SWART H. Vulnerability in graphs-a comparative survey[J]. J Combin Math Combin Comput, 1987, 1:13-22.
[3] COZZENS M. Stability measures and data fusion networks[J]. Graph Theory Notes of New York, 1994, X X VI: 8-14.
[4] COZZENS M, WU S SY. Vertex-neighbor-integrity of trees[J]. ARS Combinatoria, 1996, 43:169-180.
[5] WEI Zongtian, ZHANG Shenggui. Vertex-neighbor-integrity of composition graphs of paths[J]. ARS Combinatoria, 2008, 86:349-361.
[6] 杨雪. 图的广义p-邻域抗毁性参数研究[D]. 西安: 西安建筑科技大学, 2021. YANG Xue. A study of the general p-neighbor invulnerability parameters of graphs[D]. Xian: Xian University of Architecture and Technology, 2021.
[7] BONDY J A, MURTY U S R. Graph theory[M]. London: Springer London, 2008. doi:10.1007/978-1-84628-970-5.
[8] 刘勇, 杨淑姝, 魏宗田, 等. 图的弱毁裂度与网络抗毁性[J]. 工程数学学报, 2021, 38(3):362-368. LIU Yong, YANG Shushu, WEI Zongtian, et al. The weak rupture degree of graphs and the network invulnerability[J]. Chinese Journal of Engineering Mathematics, 2021, 38(3):362-368.
[9] 姚焱. 两类图参数的极值问题研究[D]. 淄博: 山东理工大学, 2020. YAO Yan. Study on extremal problems of two classes of graph parameters[D]. Zibo: Shandong University of Technology, 2020.
[10] LI Y K, DU M Z, LI H Y, et al. Edge rupture degree of graphs[J]. International Journal of Foundations of Computer Science, 2017, 28(8):993-1006.
[1] WENG Ting-ting, WEI Zong-tian. Weighted neighbor toughness of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(6): 36-43.
[2] LI Rui-feng, YI Zheng-ge, YUAN Wen-yong, YANG Xiao-yuan, NIU Ke. ECDSA-based auditing scheme for cloud storage [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(5): 57-65.
[3] SHI Ming, WEI Zong-tian, LIU Yong, WENG Ting-ting. Vertex weighted neighbor tenacity of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(5): 26-32.
[4] YANG Xue, WEI Zong-tian, JIANG Shu-yan. General p-neighbor scattering number of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(3): 88-95.
[5] MA Hai-feng, YANG Jia-hai, XUE Qing-shui, JU Xing-zhong, ZHU Hao-zhi, LIN Tao, YUAN Xin-xin. A not-same frequency remote data possession checking method [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(5): 81-87.
[6] YAO Ke, YANG Hai-ning, QIN Jing. Searchable encryption with data integrity verification in cloud storage [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2019, 54(1): 67-78.
[7] HAN Pan-pan, QIN Jing. Verifiable and searchable encryption scheme for outsourced database in cloud computing [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(9): 41-53.
[8] CHEN Quan1,2, XIANG Shi-jun2*. Reversible fragile watermarking for authentication based on integer DCT and expansion embedding [J]. J4, 2012, 47(11): 24-30.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd