{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:10:18Z","timestamp":1648645818124},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p> The diameter of a graph is important for the network as it measures the maximum communication delay between any pair of processors. In this paper, we study the diameter vulnerability of the directed cycle [Formula: see text] and the directed torus [Formula: see text] with respect to arc addition, that is, what is the minimum number of arcs the addition of which reduces the diameter by at least k. <\/jats:p>","DOI":"10.1142\/s1793830912500048","type":"journal-article","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T01:24:02Z","timestamp":1334021042000},"page":"1250004","source":"Crossref","is-referenced-by-count":0,"title":["DIAMETER VULNERABILITY OF DIRECTED CYCLES AND DIRECTED TORI"],"prefix":"10.1142","volume":"04","author":[{"given":"XIAOYAN","family":"MA","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]},{"given":"XIAOHUI","family":"HUANG","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]},{"given":"ZHAO","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,13]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00023-K"},{"key":"rf3","first-page":"265","volume":"37","author":"Graham N.","journal-title":"Discrete Appl. Math."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.03.008"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.01.006"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:53:36Z","timestamp":1565200416000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":5,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,13]]},"published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1142\/S1793830912500048"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500048","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}