{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:00:52Z","timestamp":1772550052550,"version":"3.50.1"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:p> The additional closeness is a very important characteristic of graphs. It measures the maximal closeness of a graph after adding a new link and it is an indication of the growth potential of graphs\u2019 closeness. Most of the time calculating the additional closeness requires solving nontrivial optimization problems. In this article, the additional closenesses of cycles, gear, and some other graphs are calculated. Bounds for additional closeness of graphs are discussed. <\/jats:p>","DOI":"10.1142\/s0129054122500149","type":"journal-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T07:35:23Z","timestamp":1655105723000},"page":"1033-1052","source":"Crossref","is-referenced-by-count":5,"title":["Additional Closeness of Cycle Graphs"],"prefix":"10.1142","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6955-7056","authenticated-orcid":false,"given":"Chavdar","family":"Dangalchev","sequence":"first","affiliation":[{"name":"Bulgarian Academy of Sciences, IMI, Sofia, Bulgaria"}]}],"member":"219","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"S0129054122500149BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.12.020"},{"issue":"1","key":"S0129054122500149BIB002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2020-1960","volume":"176","author":"Dangalchev Ch.","year":"2020","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"S0129054122500149BIB003","first-page":"1229","volume":"22","author":"Aytac A.","year":"2011","journal-title":"IJFCS"},{"key":"S0129054122500149BIB004","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2013-835"},{"issue":"8","key":"S0129054122500149BIB005","first-page":"1939","volume":"22","author":"Dangalchev Ch.","year":"2011","journal-title":"IJFCS"},{"key":"S0129054122500149BIB006","first-page":"419","volume":"118","author":"Turaci T.","year":"2015","journal-title":"Ars Combinatoria"},{"issue":"7","key":"S0129054122500149BIB007","first-page":"835","volume":"28","author":"Aytac A.","year":"2017","journal-title":"IJFCS"},{"issue":"3","key":"S0129054122500149BIB008","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1051\/ro\/2016071","volume":"52","author":"Aytac A.","year":"2017","journal-title":"RAIRO-Operations Research"},{"key":"S0129054122500149BIB009","first-page":"17","volume":"130","author":"Turaci T.","year":"2017","journal-title":"Ars Combinatoria"},{"issue":"2","key":"S0129054122500149BIB010","first-page":"209","volume":"7","author":"Aytac A.","year":"2017","journal-title":"TWMS J. Appl. Engin. Math."},{"issue":"1","key":"S0129054122500149BIB011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2018-1710","volume":"162","author":"Dangalchev Ch.","year":"2018","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"S0129054122500149BIB012","first-page":"251","volume":"26","author":"Aytac V.","year":"2018","journal-title":"Comput. Sci. J. Moldova"},{"issue":"3","key":"S0129054122500149BIB013","first-page":"447","volume":"29","author":"Berberler Z. N.","year":"2018","journal-title":"IJFCS"},{"issue":"3","key":"S0129054122500149BIB014","doi-asserted-by":"crossref","first-page":"219","DOI":"10.3233\/FI-2019-1815","volume":"167","author":"Rupnik D.","year":"2019","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"S0129054122500149BIB015","first-page":"417","volume":"30","author":"Yigit E.","year":"2019","journal-title":"IJFCS"},{"issue":"9","key":"S0129054122500149BIB016","first-page":"1","volume":"30","author":"Yigit E.","year":"2019","journal-title":"IJMPC"},{"issue":"4","key":"S0129054122500149BIB017","first-page":"461","volume":"73","author":"Dangalchev Ch.","year":"2020","journal-title":"C.R. Acad. Bulg. Sci."},{"key":"S0129054122500149BIB018","first-page":"1","volume":"32","author":"Zhou B.","year":"2021","journal-title":"IJFCS"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122500149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T03:47:14Z","timestamp":1670989634000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122500149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":18,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.1142\/S0129054122500149"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122500149","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,10]]}}}