{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T23:42:18Z","timestamp":1751758938489},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p> The rupture degree of an incomplete connected graph G is defined by[Formula: see text] where w(G \u2212 S) denotes the number of components in the graph G \u2212 S and m(G \u2212 S) is the order of the largest component of G \u2212 S. This parameter can be used to measure the vulnerability of a graph. In this paper, some bounds consisted of the relationships between the rupture degree and some vulnerability parameters on the rupture degree of a graph are given. <\/jats:p>","DOI":"10.1142\/s0129054113500366","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T06:43:49Z","timestamp":1396421029000},"page":"1329-1338","source":"Crossref","is-referenced-by-count":2,"title":["SOME RESULTS FOR THE RUPTURE DEGREE"],"prefix":"10.1142","volume":"24","author":[{"given":"AYSUN","family":"AYTA\u00c7","sequence":"first","affiliation":[{"name":"Ege University, Faculty of Sciences, Department of Math. and Computer Science, 35100, Izmir-, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HANIFE","family":"AKSU","sequence":"additional","affiliation":[{"name":"Ege University, Ege Higher Vocational School, 35100, Izmir-, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,4]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90122-Q"},{"key":"p_2","first-page":"13","volume":"1","author":"Barefoot C.A","year":"1987","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"p_3","first-page":"61","author":"Chartrand G.","year":"1968","journal-title":"New York"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90138-6"},{"key":"p_5","first-page":"8","author":"Cozzens M.","year":"1994","journal-title":"Graph Theory Notes of New York"},{"key":"p_6","first-page":"16","volume":"16","author":"Cozzens M.","year":"1994","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"p_8","first-page":"139","volume":"7","author":"Goddard W.","year":"1990","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1080\/00207160410001661681"},{"key":"p_11","first-page":"7","volume":"82","author":"Li Y.","year":"2004","journal-title":"International Journal of Computer Mathematics"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170606"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-S"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:48:58Z","timestamp":1565200138000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":11,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2014,4]]},"published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1142\/S0129054113500366"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500366","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}