{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:25:29Z","timestamp":1648661129677},"reference-count":13,"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":[[2017,12]]},"abstract":"<jats:p> The edge rupture degree of a graph [Formula: see text], as one of measurement parameter of network vulnerability, is defined as [Formula: see text], where [Formula: see text] is the number of components of [Formula: see text] and [Formula: see text] is the order of a largest component of [Formula: see text]. In this paper, general results on the edge-rupture degree of a graph are considered. Firstly, some bounds on edge rupture degree are given. Further, edge rupture degree of some graphs is caculated. Also some results are given about this parameter with others. Finally, we discuss edge rupture degree of the complement graph and give the Nordhaus\u2013Gaddum-type results for edge rupture degree. <\/jats:p>","DOI":"10.1142\/s0129054117500356","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T06:42:48Z","timestamp":1519627368000},"page":"993-1006","source":"Crossref","is-referenced-by-count":0,"title":["Edge Rupture Degree of Graphs"],"prefix":"10.1142","volume":"28","author":[{"given":"Yinkui","family":"Li","sequence":"first","affiliation":[{"name":"Center for Applied Mathematics, Tianjin University, Weijin Road, Tianjin 300072, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzhe","family":"Du","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Central South University, Lushan South Road, Changsha, Hunan 410083, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyan","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics of Qinghai Nationalities University, Bayi Road, Xining, Qinghai 810000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics of Qinghai Nationalities University, Bayi Road, Xining, Qinghai 810000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,2,25]]},"reference":[{"key":"S0129054117500356BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411000726X"},{"key":"S0129054117500356BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"S0129054117500356BIB003","first-page":"155","volume":"22","author":"Aslan E.","year":"2015","journal-title":"Dyn. Contin. Discrete Impuls. Syst. Ser. B Appl. Algorithms"},{"key":"S0129054117500356BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00051-9"},{"key":"S0129054117500356BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90299-9"},{"key":"S0129054117500356BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250103"},{"key":"S0129054117500356BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.07.040"},{"key":"S0129054117500356BIB008","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411450021X"},{"issue":"4","key":"S0129054117500356BIB010","first-page":"16","volume":"85","author":"Li Y.","year":"2008","journal-title":"International Journal of computer Mathematics"},{"key":"S0129054117500356BIB011","doi-asserted-by":"publisher","DOI":"10.1080\/00207160412331336062"},{"key":"S0129054117500356BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2010.07.001"},{"issue":"3","key":"S0129054117500356BIB014","first-page":"315","volume":"65","author":"Odabas Z. N.","year":"2012","journal-title":"Comptes Rendus de l\u2019Academie Bulgare des Sciences"},{"key":"S0129054117500356BIB015","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117500356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:49:19Z","timestamp":1565128159000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117500356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":13,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2018,2,25]]},"published-print":{"date-parts":[[2017,12]]}},"alternative-id":["10.1142\/S0129054117500356"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117500356","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}