{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:42Z","timestamp":1740142782455,"version":"3.37.3"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:00:00Z","timestamp":1706918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does not disconnect the graph. In this paper, we characterize those graphs that maximize the link residual closeness over the connected graphs with fixed order and one additional parameter such as connectivity, edge connectivity, bipartiteness, independence number, matching number, chromatic number, number of cut vertices and number of cut edges.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae006","type":"journal-article","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T18:15:25Z","timestamp":1707329725000},"page":"2286-2302","source":"Crossref","is-referenced-by-count":1,"title":["Link Residual Closeness of Graphs with Fixed Parameters"],"prefix":"10.1093","volume":"67","author":[{"given":"Leyou","family":"Xu","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University , Guangzhou 510631, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengli","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University , Guangzhou 510631, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University , Guangzhou 510631, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,2,3]]},"reference":[{"key":"2024062414162329000_ref1","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.65.056109","article-title":"Attack vulnerability of complex networks","volume":"65","author":"Holme","year":"2002","journal-title":"Phys. Rev. E."},{"key":"2024062414162329000_ref2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833993","volume-title":"Social and Economic Networks","author":"Jackson","year":"2008"},{"key":"2024062414162329000_ref3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TCOM.1970.1090419","article-title":"Analysis and design of survivable networks","volume":"18","author":"Frank","year":"1970","journal-title":"IEEE Trans. Commun. Tech."},{"key":"2024062414162329000_ref4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and Hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"2024062414162329000_ref5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"2024062414162329000_ref6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","article-title":"The binding number of a graph and its Anderson number","volume":"15","author":"Woodall","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"2024062414162329000_ref7","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.physa.2005.12.020","article-title":"Residual closeness in networks","volume":"365","author":"Dangalchev","year":"2006","journal-title":"Phys. A"},{"key":"2024062414162329000_ref8","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1142\/S0129054111008660","article-title":"Residual closeness of wheels and related networks","volume":"22","author":"Aytac","year":"2011","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2024062414162329000_ref9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1142\/S0129054117500277","article-title":"Robustness of regular caterpillars","volume":"28","author":"Aytac","year":"2017","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2024062414162329000_ref10","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1051\/ro\/2016071","article-title":"Network robustness and residual closeness","volume":"52","author":"Aytac","year":"2018","journal-title":"RAIRO Oper. Res."},{"key":"2024062414162329000_ref11","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1142\/S0129054111009136","article-title":"Residual closeness and generalized closeness","volume":"22","author":"Dangalchev","year":"2011","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2024062414162329000_ref12","first-page":"1","article-title":"Residual closeness of generalized thorn graphs","volume":"162","author":"Dangalchev","year":"2018","journal-title":"Fund. Inform."},{"key":"2024062414162329000_ref13","first-page":"297","article-title":"Residual closeness in cycles and related networks","volume":"124","author":"Odabas","year":"2013","journal-title":"Fund. Inform."},{"key":"2024062414162329000_ref14","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1007\/s40305-022-00405-9","article-title":"Residual closeness of graphs with given parameters","volume":"11","author":"Cheng","year":"2023","journal-title":"J. Oper. Res. Soc. China"},{"key":"2024062414162329000_ref15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10878-023-01042-5","article-title":"On the residual closeness of graphs with cut vertices","volume":"45","author":"Li","year":"2023","journal-title":"J. Comb. Optim."},{"key":"2024062414162329000_ref16","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1093\/comjnl\/bxac004","article-title":"Residual closeness, matching number and chromatic number","volume":"66","author":"Wang","year":"2023","journal-title":"Comput. J."},{"key":"2024062414162329000_ref17","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1142\/S0129054121500295","article-title":"Extremal results on vertex and link residual closeness","volume":"32","author":"Zhou","year":"2021","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2024062414162329000_ref18","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1142\/S0129054118500144","article-title":"Link vulnerability in networks","volume":"29","author":"Berberler","year":"2018","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2024062414162329000_ref19","doi-asserted-by":"crossref","first-page":"1950072","DOI":"10.1142\/S0129183119500724","article-title":"Link failure in wheel type networks","volume":"30","author":"Yi\u01e7it","year":"2019","journal-title":"Int. J. Modern Phys. C"},{"key":"2024062414162329000_ref20","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1142\/S0129054119500126","article-title":"A note on the link residual closeness of graphs under join operation","volume":"30","author":"Yi\u01e7it","year":"2019","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2024062414162329000_ref21","first-page":"258","article-title":"Sur le couplage maximum d\u2019un graphe","volume":"247","author":"Berge","year":"1958","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2024062414162329000_ref22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"2024062414162329000_ref23","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0021-9800(70)80089-8","article-title":"Enumeration of non-separable graphs","volume":"9","author":"Robinson","year":"1970","journal-title":"J. Combin. Theory"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/6\/2286\/58309320\/bxae006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/6\/2286\/58309320\/bxae006.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T14:56:25Z","timestamp":1719240985000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/6\/2286\/7600383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,3]]},"references-count":23,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,2,3]]},"published-print":{"date-parts":[[2024,6,24]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae006","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2024,6]]},"published":{"date-parts":[[2024,2,3]]}}}