{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:01:21Z","timestamp":1772550081769,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071158"],"award-info":[{"award-number":["12071158"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10878-023-01042-5","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T18:02:23Z","timestamp":1685469743000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the residual closeness of graphs with cut vertices"],"prefix":"10.1007","volume":"45","author":[{"given":"Chengli","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leyou","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7321-9554","authenticated-orcid":false,"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"issue":"7","key":"1042_CR1","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1142\/S0129054117500277","volume":"28","author":"A Aytac","year":"2017","unstructured":"Aytac A, Berberler ZNO (2017) Robustness of regular caterpillars. Internat J Found Comput Sci 28(7):835\u2013841. https:\/\/doi.org\/10.1142\/S0129054117500277","journal-title":"Internat J Found Comput Sci"},{"issue":"5","key":"1042_CR2","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1142\/S0129054111008660","volume":"22","author":"A Aytac","year":"2011","unstructured":"Aytac A, Odabas ZN (2011) Residual closeness of wheels and related networks. Internat J Found Comput Sci 22(5):1229\u20131240. https:\/\/doi.org\/10.1142\/S0129054111008660","journal-title":"Internat J Found Comput Sci"},{"issue":"3","key":"1042_CR3","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1051\/ro\/2016071","volume":"52","author":"A Aytac","year":"2018","unstructured":"Aytac A, Odabas Berberler ZN (2018) Network robustness and residual closeness. RAIRO Oper Res 52(3):839\u2013847. https:\/\/doi.org\/10.1051\/ro\/2016071","journal-title":"RAIRO Oper Res"},{"issue":"4","key":"1042_CR4","doi-asserted-by":"publisher","DOI":"10.1063\/1.2801687","volume":"17","author":"S Boccaletti","year":"2007","unstructured":"Boccaletti S, Buld\u00fa J, Criado R, Flores J, Latora V, Pello J (2007) Multiscale vulnerability of complex networks. Chaos 17(4):043110. https:\/\/doi.org\/10.1063\/1.2801687","journal-title":"Chaos"},{"key":"1042_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-022-00405-9","author":"M Cheng","year":"2022","unstructured":"Cheng M, Zhou B (2022) Residual closeness of graphs with given parameters. J Oper Res Soc China. https:\/\/doi.org\/10.1007\/s40305-022-00405-9","journal-title":"J Oper Res Soc China"},{"key":"1042_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V (1973) Tough graphs and Hamiltonian circuits. Discrete Math 5:215\u2013228. https:\/\/doi.org\/10.1016\/0012-365X(73)90138-6","journal-title":"Discrete Math"},{"issue":"2","key":"1042_CR7","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.physa.2005.12.020","volume":"365","author":"C Dangalchev","year":"2006","unstructured":"Dangalchev C (2006) Residual closeness in networks. Phys A 365(2):556\u2013564. https:\/\/doi.org\/10.1016\/j.physa.2005.12.020","journal-title":"Residual closeness in networks. Phys A"},{"issue":"8","key":"1042_CR8","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1142\/S0129054111009136","volume":"22","author":"C Dangalchev","year":"2011","unstructured":"Dangalchev C (2011) Residual closeness and generalized closeness. Internat J Found Comput Sci 22(8):1939\u20131948. https:\/\/doi.org\/10.1142\/S0129054111009136","journal-title":"Internat J Found Comput Sci"},{"issue":"1","key":"1042_CR9","first-page":"1","volume":"162","author":"C Dangalchev","year":"2018","unstructured":"Dangalchev C (2018) Residual closeness of generalized thorn graphs. Fund Inform 162(1):1\u201315","journal-title":"Fund Inform"},{"key":"1042_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/TCOM.1970.1090419","volume":"18","author":"H Frank","year":"1970","unstructured":"Frank H, Frisch IT (1970) Analysis and design of survivable networks. IEEE Trans Commun Tech 18:501\u2013519","journal-title":"IEEE Trans Commun Tech"},{"issue":"5","key":"1042_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.056109","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme P, Kim BJ, Yoon CN, Han SK (2002) Attack vulnerability of complex networks. Phys Rev E 65(5):056109","journal-title":"Phys Rev E"},{"key":"1042_CR12","doi-asserted-by":"publisher","DOI":"10.1515\/9781400833993","volume-title":"Social and Economic Networks","author":"MO Jackson","year":"2008","unstructured":"Jackson MO (2008) Social and Economic Networks. Princeton University Press, Princeton, New Jersey"},{"key":"1042_CR13","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 Combin Theory Ser B 24:125\u2013133. https:\/\/doi.org\/10.1016\/0095-8956(78)90013-8","journal-title":"J Combin Theory Ser B"},{"issue":"3","key":"1042_CR14","first-page":"297","volume":"124","author":"ZN Odabas","year":"2013","unstructured":"Odabas ZN, Aytac A (2013) Residual closeness in cycles and related networks. Fund Inform 124(3):297\u2013307","journal-title":"Fund Inform"},{"key":"1042_CR15","first-page":"419","volume":"118","author":"T Turaci","year":"2015","unstructured":"Turaci T, \u00d6kten M (2015) Vulnerability of Mycielski graphs via residual closeness. Ars Combin 118:419\u2013427","journal-title":"Ars Combin"},{"key":"1042_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxac004","author":"Y Wang","year":"2022","unstructured":"Wang Y, Zhou B (2022) Residual closeness, matching number and chromatic number. Comput J. https:\/\/doi.org\/10.1093\/comjnl\/bxac004","journal-title":"Comput J"},{"issue":"8","key":"1042_CR17","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1142\/S0129054121500295","volume":"32","author":"B Zhou","year":"2021","unstructured":"Zhou B, Li Z, Guo H (2021) Extremal results on vertex and link residual closeness. Internat J Found Comput Sci 32(8):921\u2013941. https:\/\/doi.org\/10.1142\/S0129054121500295","journal-title":"Internat J Found Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01042-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01042-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01042-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T04:07:01Z","timestamp":1689998821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01042-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,30]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1042"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01042-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,30]]},"assertion":[{"value":"3 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2023","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"115"}}