{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:21:55Z","timestamp":1770985315494,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"vor","delay-in-days":24,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["12161094"],"award-info":[{"award-number":["12161094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"DOI":"10.1007\/s41109-025-00772-1","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T08:22:10Z","timestamp":1768897330000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The selection of critical set for network attack targets: from the perspective of attacker"],"prefix":"10.1007","volume":"11","author":[{"given":"Wei","family":"Gao","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Cattani","sequence":"additional","affiliation":[]},{"given":"Haci Mehmet","family":"Baskonus","sequence":"additional","affiliation":[]},{"given":"Hainan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"issue":"2","key":"772_CR1","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1109\/COMST.2023.3347172","volume":"26","author":"M Ali","year":"2024","unstructured":"Ali M, Naeem F, Kaddoum G, Hossain E (2024) Metaverse communications, networking, security, and applications: Research issues, state-of-the-art, and future directions. IEEE Commun Surv Tutor 26(2):1238\u20131278","journal-title":"IEEE Commun Surv Tutor"},{"key":"772_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si AL (2000) Error and attack tolerance of complex networks. Nature 406:378\u2013382","journal-title":"Nature"},{"issue":"25","key":"772_CR3","doi-asserted-by":"publisher","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"DS Callaway","year":"2000","unstructured":"Callaway DS, Newman MEJ, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 85(25):5468\u20135471","journal-title":"Phys Rev Lett"},{"key":"772_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.comcom.2024.04.025","volume":"221","author":"A Verma","year":"2024","unstructured":"Verma A, Saha R, Kumar G, Conti M (2024) PETRAK: a solution against DDoS attacks in vehicular networks. Comput Commun 221:142\u2013154","journal-title":"Comput Commun"},{"issue":"21","key":"772_CR5","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1103\/PhysRevLett.85.4626","volume":"85","author":"R Cohen","year":"2000","unstructured":"Cohen R, Erez K, Ben-Avraham D, Havlin S (2000) Resilience of the internet to random breakdowns. Phys Rev Lett 85(21):4626\u20134628","journal-title":"Phys Rev Lett"},{"key":"772_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(90)90001-S","volume":"28","author":"D Bauer","year":"1990","unstructured":"Bauer D, Hakimi SL, Schmeichel E (1990) Recognizing tough graphs is NP-hard. Discret Appl Math 28:191\u2013195","journal-title":"Discret Appl Math"},{"issue":"2","key":"772_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/00207160211919","volume":"79","author":"S Zhang","year":"2002","unstructured":"Zhang S, Li X, Han X (2002) Computing the scattering number of graphs. Int J Comput Math 79(2):179\u2013187","journal-title":"Int J Comput Math"},{"key":"772_CR8","doi-asserted-by":"crossref","unstructured":"Li F, Li X (2004) Computing the rupture degrees of graphs, In: 7th International Symposium on Parallel Architectures, Algorithms and Networks, Hong Kong, China; pp. 368\u2013373","DOI":"10.1109\/ISPAN.2004.1300507"},{"key":"772_CR9","first-page":"13","volume":"1","author":"CA Barefoot","year":"1987","unstructured":"Barefoot CA, Entringer R, Swart H (1987) Vulnerability in graphs-a comparative survey. J Comb Math Comb Comput 1:13\u201322","journal-title":"J Comb Math Comb Comput"},{"issue":"7","key":"772_CR10","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1080\/00207160412331336062","volume":"82","author":"Y Li","year":"2005","unstructured":"Li Y, Zhang S, Li X (2005) Rupture degree of graphs. Int J Comput Math 82(7):793\u2013803","journal-title":"Int J Comput Math"},{"key":"772_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"HA Jung","year":"1978","unstructured":"Jung HA (1978) On a class of posets and the corresponding comparability graphs. J Comb Theory Series B 24:125\u2013133","journal-title":"J Comb Theory Series B"},{"key":"772_CR12","first-page":"70","volume-title":"The mean integrity of a graph, recent studies in graph theory","author":"G Chartrand","year":"1989","unstructured":"Chartrand G, Kapoor SF, McKee TA, Oellermann OR (1989) The mean integrity of a graph, recent studies in graph theory. Vishwa, Gulbarga, pp 70\u201380"},{"key":"772_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.2306\/scienceasia1513-1874.2015.41.423","volume":"41","author":"E Aslan","year":"2015","unstructured":"Aslan E (2015) Neighbour isolated scattering number of graphs. Sci Asia 41:423\u2013431","journal-title":"Sci Asia"},{"key":"772_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1051\/ita\/2016027","volume":"50","author":"E Aslan","year":"2016","unstructured":"Aslan E, Kilinc D, Y\u00fccalar F, Boranda\u01e7 E (2016) The average scattering number of graphs. RAIRO-Theor Inf Appl 50:263\u2013272","journal-title":"RAIRO-Theor Inf Appl"},{"issue":"1","key":"772_CR15","first-page":"233","volume":"78","author":"E Aslan","year":"2016","unstructured":"Aslan E, Turan GB (2016) Mean rupture degree of graphs. UPB Sci Bulletin Series A Appl Math Phys 78(1):233\u2013242","journal-title":"UPB Sci Bulletin Series A Appl Math Phys"},{"key":"772_CR16","first-page":"329","volume":"337","author":"Y Li","year":"2018","unstructured":"Li Y, Gu R (2018) Bounds for scattering number and rupture degree of graphs with genus. Appl Math Comput 337:329\u2013334","journal-title":"Appl Math Comput"},{"issue":"7","key":"772_CR17","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1142\/S0129054118500247","volume":"29","author":"\u00d6K K\u00fcrkc\u00fc","year":"2018","unstructured":"K\u00fcrkc\u00fc \u00d6K, Aslan E (2018) A comparison between edge neighbor rupture degree and edge scattering number in graphs. Int J Found Comput Sci 29(7):1119\u20131142","journal-title":"Int J Found Comput Sci"},{"issue":"5","key":"772_CR18","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.3906\/elk-1903-29","volume":"27","author":"R Durgut","year":"2019","unstructured":"Durgut R, Turaci T (2019) Hakan Kutucu, A heuristic algorithm to find rupture degree in graphs. Turkish J Electrical Eng Comput Sci 27(5):3433\u20133441","journal-title":"Turkish J Electrical Eng Comput Sci"},{"key":"772_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00373-022-02498-8","volume":"38","author":"L Markenzon","year":"2022","unstructured":"Markenzon L, Waga CFEM (2022) The scattering number of strictly chordal graphs: Linear time determination. Graphs and Combinatorics 38:102. https:\/\/doi.org\/10.1007\/s00373-022-02498-8","journal-title":"Graphs and Combinatorics"},{"issue":"5","key":"772_CR20","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.2298\/FIL2405783S","volume":"38","author":"VS Agnes","year":"2024","unstructured":"Agnes VS, Geethanjaliyadav R (2024) Rupture degree and weak rupture degree of gear graphs. Filomat 38(5):1783\u20131792","journal-title":"Filomat"},{"key":"772_CR21","volume-title":"I ching introduction","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm R (2008) I ching introduction. English translation by Cary F, Baynes"},{"issue":"1","key":"772_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TCYB.2015.2512286","volume":"47","author":"CP Chen","year":"2016","unstructured":"Chen CP, Zhang T, Chen L, Tam SC (2016) I-ching divination evolutionary algorithm and its convergence analysis. IEEE T Cybern 47(1):2\u201313","journal-title":"IEEE T Cybern"},{"key":"772_CR23","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0095-8956(79)90081-9","volume":"27","author":"EF Schmeichel","year":"1979","unstructured":"Schmeichel EF, Bloom GS (1979) Connectivity, genus, and the number of components in vertex-deleted subgraphs. J Comb Theory Series B 27:198\u2013201","journal-title":"J Comb Theory Series B"},{"key":"772_CR24","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02993245","volume":"28","author":"G Ringel","year":"1965","unstructured":"Ringel G (1965) Das Geschlect des vollst indiger paaren Graphen. Abh Math Semin Univ Hambg 28:139\u2013150","journal-title":"Abh Math Semin Univ Hambg"},{"key":"772_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108153","volume":"133","author":"H Zhang","year":"2024","unstructured":"Zhang H, Gan J, Zhou J, Gao W (2024) Rank-based multimodal immune algorithm for many-objective optimization problems. Eng Appl Artif Intell 133:108153","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"772_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-93025-1_4","volume":"780","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili S (2019) Genetic algorithm. Evolutionary algorithms and neural networks: theory and applications, Studies in computational intelligence 780(1):43\u201353","journal-title":"Evolutionary algorithms and neural networks: theory and applications, Studies in computational intelligence"},{"key":"772_CR27","doi-asserted-by":"crossref","unstructured":"Daniel D, Chaimatanan S, Mongeau M (2019) Simulated annealing: from basics to applications. In: Michel Gendreau and Jean-Yves Potvin (eds) Handbook of metaheuristics, 3rd edn. Springer, Heidelberg, pp 1\u201335","DOI":"10.1007\/978-3-319-91086-4_1"},{"key":"772_CR28","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer[J]. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"772_CR29","doi-asserted-by":"publisher","unstructured":"Al-Ofeishat HA, Alkasassbeh JS, Awajan A et al (2025) Analysis and comparison of raw network packet datasets using machine learning classification and grey wolf optimization[J]. Int J Adv Soft Comput Appl 17(1). https:\/\/doi.org\/10.15849\/IJASCA.250330.13","DOI":"10.15849\/IJASCA.250330.13"},{"key":"772_CR30","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The Network Data Repository with Interactive Graph Analytics and Visualization, AAAI Conference on Artificial Intelligence, Available at: https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00772-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00772-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00772-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:39:53Z","timestamp":1770982793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41109-025-00772-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["772"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00772-1","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"20 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}