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    

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)

191

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] YANG Jia-rui, CHEN Xiang-en. Vertex-distinguishing general total coloring of K3,3,p [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(1): 18-23.
[2] ZHANG Wen-juan, LI Jin-jin, LIN Yi-dong. Graph-based granularity reduction in pessimistic multi-granulation rough set [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(1): 60-67.
[3] YANG Guang-bo, WANG Cai-shi, LUO Yan, WANG Yan-yan, NAN Xue-qi. 2-Tessellable staggered quantum walk on finite even cycles [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(1): 52-59.
[4] ZHANG Shuang, ZHU Yan. 2-factor of edge colored graph [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(1): 24-28.
[5] LIU Zhuo-ya, XU Chang-qing. Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 36-41.
[6] NIU Bei, ZHANG Xin. Vertex-disjoint triangles in anti-d-degenerate graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 51-53.
[7] Qiu-liang XU. A high-performance FPGA-based implementation method of SM9 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 54-61.
[8] LU Peng-li, LIU Wen-zhi. On the generalized distance spectrum of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 19-28.
[9] WANG Bi-mei, LI Jing-wen, GU Yan-bo, SHAO Shu-hong. Edge-magic total labeling of unicyclic graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(9): 42-50.
[10] CHEN Hong-yu, ZHONG Bin. Linear 2-arboricity of planar graphs without intersecting 5-cycles [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(7): 38-45.
[11] LA Bai, DENG Bo, YE Cheng-fu, FU Feng, LI Yi-jing. Balaban indices of three kinds of regular graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(4): 97-101.
[12] Ying LI,Jun HU. Hierarchical trusted cryptography service framework based on distributed message drive [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(3): 19-27.
[13] Liu-ying WEN,Wei YUAN. Clustering method for multi-label symbolic value partition [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(3): 58-69.
[14] Yan-hua YANG,Li-gang YAO. Fault tracing method of industrial production control data network based on SDG simplified model [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(11): 46-57.
[15] SUN Shuang, LIU Hong-xing. The inclusion graph of S-acts [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2019, 54(8): 121-126.
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