{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:01:00Z","timestamp":1772550060432,"version":"3.50.1"},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Residual closeness is a novel graph-based network vulnerability parameter. In this model, links are perfectly reliable and the nodes fail independently of each other. We characterize those graphs with maximum residual closeness and those connected graphs with minimum residual closeness when matching number (chromatic number, respectively) is fixed.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac004","type":"journal-article","created":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T12:07:22Z","timestamp":1642162042000},"page":"1156-1166","source":"Crossref","is-referenced-by-count":11,"title":["Residual Closeness, Matching Number and Chromatic Number"],"prefix":"10.1093","volume":"66","author":[{"given":"Yanna","family":"Wang","sequence":"first","affiliation":[{"name":"Basic Courses Department , Guangdong Communication Polytechnic, Guangzhou 510650, 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":[[2022,2,12]]},"reference":[{"key":"2023052000432743800_ref1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.20450","article-title":"Proximity and remoteness in graphs: results and conjectures","volume":"58","author":"Aouchiche","year":"2011","journal-title":"Networks"},{"key":"2023052000432743800_ref2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.dam.2016.04.031","article-title":"Proximity, remoteness and distance eigenvalues of a graph","volume":"213","author":"Aouchiche","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"2023052000432743800_ref3","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":"Internat. J. Found. Comput. Sci."},{"key":"2023052000432743800_ref4","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":"Internat. J. Found. Comput. Sci."},{"key":"2023052000432743800_ref5","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":"2023052000432743800_ref6","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":"Internat. J. Found. Comput. Sci."},{"key":"2023052000432743800_ref7","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":"2023052000432743800_ref8","doi-asserted-by":"crossref","DOI":"10.1063\/1.2801687","article-title":"Multiscale vulnerability of complex networks","volume":"17","author":"Boccaletti","year":"2007","journal-title":"Chaos"},{"key":"2023052000432743800_ref9","volume-title":"Distance in Graphs","author":"Buckley","year":"1990"},{"key":"2023052000432743800_ref10","doi-asserted-by":"crossref","DOI":"10.1007\/s40305-022-00405-9","article-title":"Residual closeness of graphs with given parameters","author":"Cheng","year":"2022","journal-title":"Accepted for publication in J. Oper. Res. Soc. China"},{"key":"2023052000432743800_ref11","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":"Chvatal","year":"1973","journal-title":"Discrete Math."},{"key":"2023052000432743800_ref12","first-page":"556","volume":"365","author":"Dangalchev","year":"2006","journal-title":"Residual closeness in networks. Phisica A"},{"key":"2023052000432743800_ref13","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":"Internat. J. Found. Comput. Sci."},{"key":"2023052000432743800_ref14","first-page":"1","article-title":"Residual closeness of generalized thorn graphs","volume":"162","author":"Dangalchev","year":"2018","journal-title":"Fund. Inform."},{"key":"2023052000432743800_ref15","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."},{"key":"2023052000432743800_ref16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(88)90069-6","article-title":"Scattering number and extremal non-Hamiltonian graphs","volume":"71","author":"Hendry","year":"1988","journal-title":"Discrete Math."},{"key":"2023052000432743800_ref17","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":"2023052000432743800_ref18","first-page":"297","article-title":"Residual closeness in cycles and related networks","volume":"124","author":"Odabas","year":"2013","journal-title":"Fund. Inform."},{"key":"2023052000432743800_ref19","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1002\/net.21558","article-title":"Bounds on the radius and status of graphs","volume":"64","author":"Rissner","year":"2014","journal-title":"Networks"},{"key":"2023052000432743800_ref20","first-page":"219","article-title":"Networks with extremal closeness","volume":"167","author":"Rupnik Poklukar","year":"2019","journal-title":"Fund. Inform."},{"key":"2023052000432743800_ref21","volume-title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","author":"Scheinerman","year":"1997"},{"key":"2023052000432743800_ref22","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":"2023052000432743800_ref23","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":"Internat. J. Found. Comput. Sci."},{"key":"2023052000432743800_ref24","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":"Internat. J. Modern Phys. C"},{"key":"2023052000432743800_ref25","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":"Internat. J. Found. Comput. Sci."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/5\/1156\/50397284\/bxac004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/5\/1156\/50397284\/bxac004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T00:43:54Z","timestamp":1684543434000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/5\/1156\/6527283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,12]]},"references-count":25,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2022,2,12]]},"published-print":{"date-parts":[[2023,5,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac004","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,5]]},"published":{"date-parts":[[2022,2,12]]}}}