JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2021, Vol. 56 ›› Issue (3): 88-95.doi: 10.6040/j.issn.1671-9352.0.2020.355

Previous Articles     Next Articles

General p-neighbor scattering number of graphs

YANG Xue, WEI Zong-tian, JIANG Shu-yan   

  1. Department of Mathematics, Xian University of Architecture and Technology, Xian 710055, Shaanxi, China
  • Published:2021-03-16

PDF (PC)

651

Abstract: The study of network neighbor invulnerability originated from spy networks. The particularity is that if a vertex has been destroyed, its adjacent vertices will be useless as a whole. However, the most likely situation is that if a vertex has been destroyed, its adjacent vertices will be failed with some probability p. Based on this idea, the concept of general p-neighbor scattering number is proposed. The p-neighbor scattering number formula of some special graphs and line graphs are given. The accuracy of network neighbor invulnerability measure is illustrated by the analysis of the relationship of p and the general p-neighbor scattering number.

Key words: graph, vertex-neighbor-scattering number, failure probability, general p-neighbor scattering number, invulnerability

CLC Number: 

  • O157.5
[1] 王玥, 蔡皖东, 段琪. 基于遗传算法的网络脆弱性计算方法[J]. 系统仿真学报, 2009, 21(6):1628-1632. WANG Yue, CAI Wandong, DUAN Qi. Computing vulnerability of network based on genetic algorithm[J]. Journal of System Simulation, 2009, 21(6):1628-1632.
[2] 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.
[3] GUNTHER G. Neighbour-connectivity in regular graphs[J]. Discrete Applied Mathematics, 1985, 11(3):233-243.
[4] COZZENS M B, WU S S Y. The minimum size of critically m-neighbor connected graphs[J]. Ars Combinatoria, 1990, 29:149-160.
[5] WEI Zongtian, ZHANG Shenggui. Vertex-neighbor-integrity of composition graphs of paths[J]. Ars Combinatoria, 2008, 86(6):349-361.
[6] WEI Zongtian, MAI Anchan, ZHAI Meijuan. Vertex-neighbor-scattering number of graphs[J]. Ars Combinatoria, 2007, 85(10):417-426.
[7] BONDY J A, MURTY U S R. Graph theory[M]. London: Springer London, 2008.
[8] COZZENS M B, WU S S Y. Edge-neighbor-integrity of trees[J]. Australasian Journal of Combinatorics, 1994, 10(10):163-174.
[9] 杨君兰. 分裂图的k-正常指标研究[D]. 郑州: 郑州大学, 2019. YANG Junlan. Research on the k-proper index of split graphs[D]. Zhengzhou: Zhengzhou University, 2019.
[10] 赵雪冰,张昭. 线图的邻域连通度(英文)[J]. 新疆大学学报(自然科学版), 2009,26(4):379-382,401,505. ZHAO Xuebing, ZHANG Zhao. Neighbor connectivity of line graphs[J]. Journal of Xinjiang University(Natural Science Edition), 2009, 26(4):379-382,401,505.
[1] TANG Buzhou, HU Han. Construction of technology and application of knowledge graph in power safety [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(5): 18-26.
[2] ZHANG Luning, WANG Jingsheng. Traffic speed prediction study based on adaptive residual dynamic fusion graph attention network [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(5): 90-101.
[3] BAI Yuerong, WEI Zongtian, WANG Deli. Analysis of network invulnerability based on the multi-fire source burning connectivity [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(4): 102-108.
[4] WANG Zhixuan, PANG Jifang, WANG Zhiqiang, SONG Peng, LI Ru. Attribute enhanced temporary group recommendation algorithm fusing long-and short-term interests [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(3): 54-65.
[5] WANG Jiang, LI Jingwen, GAO Xin, SUN Liangjing. Adjacent vertex reducible total labeling of some joint graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(8): 57-67.
[6] WANG Hui, LIU Mengmeng. Lower bound of Mostar index with respect to tricyclic graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(8): 68-77.
[7] WU Xiaojun, CHEN Yidan, HAO Yaojun, SONG Changwei, HE Deqing. Multi-label feature selection with label manifold and dynamic graph constraints [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(7): 69-83.
[8] WU Xinyao, XU Ji. Hierarchical graph representation learning based on graphical mutual information pooling [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(7): 84-93.
[9] QIAN Wenbin, PENG Jiahao, CAI Xingxing. Knowledge graph representation learning based on neighborhood granularity and three-way decision [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(7): 94-103.
[10] REN Yanlan, XIE Yunli. The non-leaving-face property of exchange graphs of cluster algebras via G -systems [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(5): 79-86.
[11] GUO Yaqin, CHEN Xiangen. E-total colorings of complete bipartite graphs K1,n, K2,n and K3,n which are vertex-distinguished by multiple sets [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(2): 24-33.
[12] LIU Zhaozhi, Metrose Metsidik. Linear arboricity of product graphs of 1-degenerate graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(2): 51-62.
[13] LYU Zhen, WEI Zongtian. S-T reconstruction of graph based on connectivity optimization [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(12): 156-160.
[14] BAI Yu, QIANG Huiying, HE Jing. Neighbor sum distinguishing edge coloring of join graphs Cm∨Cn [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(12): 161-166.
[15] Liang GUI,Yao XU,Shizhu HE,Yuanzhe ZHANG,Kang LIU,Jun ZHAO. Factual error detection in knowledge graphs based on dynamic neighbor selection [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 76-84.
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