On agglomeration-based rupture degree in networks and a heuristic algorithm

[1] E. Aslan, Weak-rupture degree of graphs, Int. Journal of Foundations of Computer Science. 27, 6 (2016) 725–738. doi:10.1142/S0129054116500258 ⇒126 Open DOISearch in Google Scholar

[2] E. Aslan, Edge-rupture degree of a graph, Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms. 22, 2 (2015) 155–161. ⇒126 Search in Google Scholar

[3] A. Aytac, H. Aksu, Some results for the rupture degree, International Journal of Foundations of Computer Science. 24, 8 (2013) 1329–1338. doi:10.1142/S0129054113500366 ⇒126 Open DOISearch in Google Scholar

[4] A. Aytac, H. Aksu, The rupture degree of some graphs, Mathematica Balkanica. 24, 1-2(2010) 85–101. ⇒126 Search in Google Scholar

[5] A. Aytac, Z.N. Odabas, Computing the rupture degree in composite graphs, International Journal of Foundations of Computer Science. 21, 3 (2010) 311–319. doi:10.1142/S012905411000726X ⇒126 Open DOISearch in Google Scholar

[6] A. Aytac, T. Turaci, Vertex vulnerability parameter of gear graphs, International Journal of Foundations of Computer Science. 22, 5 (2011) 1187–1195. ⇒125 Search in Google Scholar

[7] V. Aytac, T. Turaci, Relationships between vertex attack tolerance and other vulnerability parameters, RAIRO - Theoretical Informatics and Applications. 51, 1 (2017) 17–27. doi:10.1051/ita/2017005 ⇒125 Open DOISearch in Google Scholar

[8] G. Bacak-Turan, E. Oz, Neighbor rupture degree of transformation graphs G^xy-, International Journal of Foundations of Computer Science. 28, 4 (2017) 335–355. doi:10.1142/S0129054117500216 ⇒126 Open DOISearch in Google Scholar

[9] K.S. Bagga, L.W. Beineke, W.D. Goddard, M.J. Lipman, R.E. Pippert, A survey of integrity, Discrete Applied Mathematics. 37-38 (1992) 13–28. doi:10.1016/0166-218X(92)90122-Q ⇒125 Open DOISearch in Google Scholar

[10] Z.N. Berberler, H.İ. Yildirim, T. İltüzer, İ Tunç, Agglomeration-Based Node Importance Analysis in Wheel-Type Networks, International Journal of Foundations of Computer Science. 32, 3 (2021) 26–288. doi:10.1142/S0129054121500210 ⇒127 Open DOISearch in Google Scholar

[11] M. E. Berberler, Z. N. Berberler, Measuring the vulnerability in networks: a heuristic approach, Ars Combinatoria. 135 (2017) 3–15. ⇒126, 136 Search in Google Scholar

[12] V. Chvatal, Tough graphs and Hamiltonian circuits, Discrete Mathematics. 5, 3 (1973) 215–228. doi:10.1016/0012-365X(73)90138-6 ⇒125 Open DOISearch in Google Scholar

[13] M. Cozzens, D. Moazzami, S. Stueckle, The tenacity of a graph, 17th Int. Conf. Theory and Applications of Graphs, Wiley, New York, 1995, pp. 1111–1122. ⇒125 Search in Google Scholar

[14] R. Durgut, H. Kutucu and T. Turacı, Global distribution center number of some graphs and an algorithm, RAIRO-Operations Research. 53, 4 (2019) 1217–1227. doi:10.1051/ro/2018119 ⇒125 Open DOISearch in Google Scholar

[15] R. Durgut, T. Turacı, H. Kutucu, A heuristic algorithm to find rupture degree in graphs, Turk. J. Elec. Eng. & Comp Sci. 27 (2019) 3433 – 3441. doi:10.3906/elk-1903-29 ⇒126, 136 Open DOISearch in Google Scholar

[16] H. Frank, I.T. Frisch, Analysis and design of survivable networks, IEEE Transactions on Communications Technology, 18, 5 (1970) 501–519. doi:10.1109/TCOM.1970.1090419 ⇒125 Open DOISearch in Google Scholar

[17] M.A. Henning, Trees with Equal Average Domination and Independent Domination Numbers, Ars Combinatoria. 71 (2004) 305–318. ⇒125 Search in Google Scholar

[18] H. A. Jung, On maximal circuits infinite graphs, Annals of Discrete Mathematics. 3 (1978) 129–144. doi:10.1016/S0167-5060(08)70503-X ⇒125 Open DOISearch in Google Scholar

[19] A. A. Kunt, Z. N. Berberler, E cient identification of node importance based on agglomeration in cycle-related networks, International Journal of Foundations of Computer Science. 31, 7 (2020) 969–978. doi:doi:10.1142/S0129054120500379 ⇒127 Open DOISearch in Google Scholar

[20] A. Kirlangic, G. Bacak-Turan, On the rupture degree of a graph, Neural Network World. 22, 1 (2012) 39–51. doi:10.14311/NNW.2012.22.003 ⇒126 Open DOISearch in Google Scholar

[21] O.K. Kurkçu, E. Aslan, A comparison between edge neighbor rupture degree and edge scattering number in graphs, International Journal of Foundations of Computer Science 29, 7 (2018) 1119–1142. doi:10.1142/S0129054118500247 ⇒126 Open DOISearch in Google Scholar

[22] I. Mishkovski, M. Biey, L. Kocarev, Vulnerability of complex networks, Communications in Nonlinear Science and Numerical Simulation. 16, 1 (2011) 341–349. doi:10.1016/j.cnsns.2010.03.018 ⇒125 Open DOISearch in Google Scholar

[23] Y. Li, S. Zhang, X. Li, Rupture degree of graphs, International Journal of Computer Mathematics. 82, 7 (2005) 793–803. doi:10.1080/00207160412331336062 ⇒125, 130, 132, 133, 134 Open DOISearch in Google Scholar

[24] Y. Li, The rupture degree of trees. International Journal of Computer Mathematics. 85, 11 (2008) 1629–1635. doi:10.1080/00207160701553367 ⇒126 Open DOISearch in Google Scholar

[25] F. Li, Isolated rupture degree of trees and gear graphs, Neural Network World. 25, 3 (2015) 287–300. doi:10.14311/NNW.2015.25.015 ⇒126 Open DOISearch in Google Scholar

[26] F. Li, X. Li, Computing the rupture degrees of graphs. 7th International Symposium on Parallel Architectures, Algorithms and Networks. 2004, pp. 368–373, Hong Kong, China. ⇒126 Search in Google Scholar

[27] Z.N. Odabas, A. Aytac, Rupture degree and middle graphs, Comptes Rendus de Lacademie Bulgare des Sciences. 65, 3 (2010) 315–322. ⇒126 Search in Google Scholar

[28] Y. J. Tan, W. Jun, H. Z. Deng, Evaluation method for node importance based on node contraction in complex networks, Systems Engineering-Theory & Practice. 11.11 (2006) 79–83. ⇒127 Search in Google Scholar

[29] T. Turacı, A. Aytac, Combining the Concepts of Residual and Domination in Graphs, Fundamenta Informaticae. 166, 4 (2019) 379–392. doi:10.3233/FI-2019-1806 ⇒125 Open DOISearch in Google Scholar

[30] T. Turacı, On combining the methods of link residual and domination in networks, Fundamenta Informaticae. 174, 1 (2020) 43–59. doi:10.3233/FI-2020-1930 ⇒125 Open DOISearch in Google Scholar

[31] T. Turaci, E. Aslan, The average lower reinforcement number a graph, RAIROTheor. Inf. Appl. 50, 2 (2016) 135–144. doi:doi:10.1051/ita/2016015 ⇒125 Open DOISearch in Google Scholar

[32] T. Turaci, On the average lower bondage number a graph, RAIRO-Operations Research. 50, 4-5 (2016) 1003–1012. doi:10.1051/ro/2015062 ⇒125 Open DOISearch in Google Scholar

[33] B.D. West, Introduction to Graph Theory. 2nd ed. Urbana, NJ, USA: Prentice Hall, 2001. ⇒125 Search in Google Scholar