{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:48:33Z","timestamp":1648910913494},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p> The vulnerability shows the endurance of the network until the communication collapse after the breakdown of certain stations or communication links. If a spy or a station is invaded in a spy network, then the adjacent stations are treacherous. A vulnerability parameter the neighbor rupture degree can be used to obtain the vulnerability of a spy network. The neighbor rupture degree of a noncomplete connected graph G is defined to be [Formula: see text] where S is any vertex subversion strategy of G, w(G\/S) is the number of connected components in G\/S, and c(G\/S) is the maximum order of the components of G\/S. In this paper, the neighbor rupture degree of Harary graphs are obtained. <\/jats:p>","DOI":"10.1142\/s012905411650026x","type":"journal-article","created":{"date-parts":[[2016,11,15]],"date-time":"2016-11-15T08:52:57Z","timestamp":1479199977000},"page":"739-756","source":"Crossref","is-referenced-by-count":0,"title":["Neighbor Rupture Degree of Harary Graphs"],"prefix":"10.1142","volume":"27","author":[{"given":"Ferhan Nihan","family":"Altundag","sequence":"first","affiliation":[{"name":"Department of Mathematics, Manisa Celal Bayar University, Turkey"}]},{"given":"Goksen","family":"Bacak-Turan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Manisa Celal Bayar University, Turkey"}]}],"member":"219","published-online":{"date-parts":[[2016,11,15]]},"reference":[{"key":"p_2","first-page":"333","volume":"102","author":"Bacak-Turan G.","year":"2011","journal-title":"ARS Combinatoria"},{"key":"p_3","first-page":"25","author":"Barefoot C. A.","year":"1987","journal-title":"J. Combin. Comput. ("},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.48.7.1142"},{"key":"p_6","first-page":"269","volume":"5573","author":"Li F.","year":"2009","journal-title":"Computer Science"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90075-7"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90013-8"},{"key":"p_12","first-page":"33","volume":"16","author":"Cozzens M. B.","year":"1994","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"p_13","first-page":"169","volume":"43","author":"Cozzens M. B.","year":"1996","journal-title":"Ars Combinatoria"},{"issue":"3","key":"p_15","first-page":"43","volume":"29","author":"Ouyang K. Z.","year":"1993","journal-title":"J. Lanzhou University"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/836395"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1080\/00207160412331336062"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411650026X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:22:28Z","timestamp":1565151748000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411650026X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":11,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2016,11,15]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1142\/S012905411650026X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411650026x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}