广义Petersen图的混合边邻域粘连度
The Mixed Edge Neighbor Tenacity of Generalized Petersen Graphs
摘要: 已知图的混合边邻域粘连度概念以及几类基本图的参数计算公式后，本文给出了广义Petersen图的混合边邻域粘连度的计算公式，使得混合边邻域粘连度算法更为细化，刻画某些网络的抗毁性更为精确。
Abstract: After the concept of mixed edge neighbor tenacity of graphs and the formula for calculating param-eters of some basic graphs are known, the formula for calculating mixed edge neighbor tenacity of generalized Petersen graph is given, which makes the algorithm of mixed edge neighborhood adhe-sion more refined and the damage resistance of some networks more accurate.
文章引用：段云清, 武彩萍. 广义Petersen图的混合边邻域粘连度[J]. 应用数学进展, 2024, 13(2): 723-729. https://doi.org/10.12677/AAM.2024.132070

参考文献

[1] Gunther, G. (1985) Neighbor-Connectivity in Regular Graphs. Discrete Applied Mathematics, 11, 233-243. [Google Scholar] [CrossRef] 
[2] 陈忠, 李银奎. 完全k叉树的粘连度[J]. 纯粹数学与应用数学, 2013, 29(5): 484-488.
[3] Gu, M.M., Pai, K.J. and Chang, J.M. (2023) Subversion Analyses of Hierarchical Networks Based on (Edge) Neighbor Connectivity. Journal of Parallel and Distributed Computing, 171, 54-65. [Google Scholar] [CrossRef] 
[4] Cozzens, M.B. and Wu, S.S.Y. (1995) Extreme Values of Edge-Neighbor-Connectivity. Ars Combinatoria, 39, 199-210.
[5] Zhao, X.B., Zhang, Z. and Ren, Q. (2011) Edge Neighbor Connectivity of Cartesian Product Graph G x K2. Applied Mathematics and Computation, 217, 5508-5511. [Google Scholar] [CrossRef] 
[6] Bacak, T.G. and Kirlangic, A. (2013) Neighbor Integrity of Trans-formation Graphs. International Journal of Foundations of Computer Science, 24, 303-317. [Google Scholar] [CrossRef] 
[7] Cozzens, M.B. and Wu, S.S.Y. (1997) Bounds of Edge-Neighbor-Integrity of Graphs. Australasian Journal of Combinatorics, 15, 71-80.
[8] Wei, Z.T., Qi, N.N. and Yue, X.K. (2016) Vertex-Neighbor-Scattering Number of Bipartite Graphs. International Journal of Foundations of Computer Science, 27, 501-509. [Google Scholar] [CrossRef] 
[9] Wei, Z.T., Qi, N.N. and Yue, X.K. (2013) Computing the Edge-Neighbor-Scattering Number of Graphs. Zeitschrift fur Naturforschung A, 68, 599-604. [Google Scholar] [CrossRef] 
[10] Liu, Y., Wei, Z.T., Shi, J. and Mai, A.C. (2016) A Polynomial Algo-rithm of Edge-Neighbor-Scattering Number of Trees. Applied Mathematics and Computation, 283, 1-5. [Google Scholar] [CrossRef] 
[11] 杨静婷. 图的邻域坚韧度研究[D]: [硕士学位论文]. 西安: 西安建筑科技大学, 2017.
[12] 杨玉成. 图的边邻域坚韧度研究[D]: [硕士学位论文]. 西安: 西安建筑科技大学, 2019.
[13] Feng, X., Wei, Z.T. and Yang, Y.C. (2022) Edge Neighbor Toughness of Graphs. Axiom, 11, Article 248. [Google Scholar] [CrossRef] 
[14] Bacak-Turan, G. and and Oz, E. (2017) Neighbor Rupture Degree of Transformation Graphs Gxy-. International Journal of Foundations of Computer Science, 28, 335-355. [Google Scholar] [CrossRef] 
[15] Aslan, E. (2013) Edge-Neighbor-Rupture Degree of Graphs. Journal of Applied Mathematics, 2013, Article ID: 783610. [Google Scholar] [CrossRef] 
[16] Kurkcu, O.K. and Aslan, E. (2018) A Comparison between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs. International Journal of Foundations of Computer Science, 29, 1119-1142. [Google Scholar] [CrossRef] 
[17] 闫伟, 魏宗田. 图的混合边邻域粘连度[J]. 山西大学学报(自然科学版): 1-12.
https://kns.cnki.net/kcms2/article/abstract? v=f2Ae6OvU-JLJXPF5CLFWKeefdu2cPA_nGciw2tR-goYvPP efp1-MjlsUUw-LCN2UFNVZdRrah1WeBktQMr6JJApMG5hy3rqWVhzHlOJ65LG_ bUcLSBA2Qj0lToTToSBppxTXc4Ph71U=&uniplatform=NZKP T&language=CHS, 2023-10-28.
[18] 毛华, 赵小娜, 史田敏. 多部图的最大匹配算法[J]. 郑州大学学报(理学版), 2013, 45(1): 27-29, 37.
[19] Bondyj, A. and Murty, U.S.R.M. (2008) Graph Theory. Springer, London.
[20] 魏宗田, 刘勇, 杨威, 等. 网络抗毁性[M]. 西安: 西安交通大学出版社, 2015.

为你推荐