{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:42:41Z","timestamp":1772826161638,"version":"3.50.1"},"reference-count":21,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","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":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p> Robustness of the network topology is a key aspect in the design of computer networks. Vertex (Link, respectively) residual closeness is a new graph-theoretic concept defined as a measure of network robustness due to the failure of individual vertices (links, respectively). In this paper, we identify the trees and unicyclic graphs with the first a few smallest vertex residual closeness, and determine the graphs that minimize or maximize the vertex (link, respectively) residual closeness over some classes of graphs. <\/jats:p>","DOI":"10.1142\/s0129054121500295","type":"journal-article","created":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T05:58:46Z","timestamp":1630994326000},"page":"921-941","source":"Crossref","is-referenced-by-count":12,"title":["Extremal Results on Vertex and Link Residual Closeness"],"prefix":"10.1142","volume":"32","author":[{"given":"Bo","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1623-9019","authenticated-orcid":false,"given":"Haiyan","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer Science, South China Normal University, Guangzhou 510631, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"S0129054121500295BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008660"},{"key":"S0129054121500295BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054117500277"},{"key":"S0129054121500295BIB003","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2016071"},{"key":"S0129054121500295BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054118500144"},{"key":"S0129054121500295BIB005","volume-title":"Distance in Graphs","author":"Buckley F.","year":"1990"},{"key":"S0129054121500295BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.12.020"},{"key":"S0129054121500295BIB007","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111009136"},{"issue":"1","key":"S0129054121500295BIB008","first-page":"1","volume":"162","author":"Dangalchev C.","year":"2018","journal-title":"Fund. Inform."},{"key":"S0129054121500295BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.08.004"},{"key":"S0129054121500295BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-001-1021-7"},{"key":"S0129054121500295BIB011","first-page":"57","volume":"31","author":"Gutman I.","year":"2006","journal-title":"Bull. Cl. Sci. Math. Nat. Sci. Math."},{"key":"S0129054121500295BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.001"},{"key":"S0129054121500295BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.03.029"},{"key":"S0129054121500295BIB014","doi-asserted-by":"publisher","DOI":"10.1515\/9781400833993"},{"issue":"1","key":"S0129054121500295BIB015","first-page":"311","volume":"68","author":"Klav\u017ear S.","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"3","key":"S0129054121500295BIB016","first-page":"297","volume":"124","author":"Odabas Z. N.","year":"2013","journal-title":"Fund. Inform."},{"issue":"4","key":"S0129054121500295BIB017","first-page":"447","volume":"147","author":"Rupnik Poklukar D.","year":"2016","journal-title":"Fund. Inform."},{"issue":"3","key":"S0129054121500295BIB018","first-page":"219","volume":"167","author":"Rupnik Poklukar D.","year":"2019","journal-title":"Fund. Inform."},{"key":"S0129054121500295BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.11.016"},{"key":"S0129054121500295BIB020","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054119500126"},{"key":"S0129054121500295BIB021","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183119500724"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054121500295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T05:55:17Z","timestamp":1640325317000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054121500295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":21,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S0129054121500295"],"URL":"https:\/\/doi.org\/10.1142\/s0129054121500295","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,6]]}}}