{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:12Z","timestamp":1759638132401},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2015,2]]},"abstract":"<jats:p> The arrangement graph A<jats:sub>n,k<\/jats:sub> is one of the attractive underlying topologies for distributed systems. Let f<jats:sub>m<\/jats:sub>(n, k) be the minimum number of faulty links that make every sub-arrangement graph A<jats:sub>n-m,k-m<\/jats:sub> faulty in A<jats:sub>n,k<\/jats:sub> under link failure model. In this paper, we proved that [Formula: see text], [Formula: see text], and [Formula: see text] for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054115500148","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T04:05:36Z","timestamp":1430885136000},"page":"241-254","source":"Crossref","is-referenced-by-count":6,"title":["Link Failure Tolerance in the Arrangement Graphs"],"prefix":"10.1142","volume":"26","author":[{"given":"Kai","family":"Feng","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi 030006, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiying","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00052-0"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.07.007"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265912500077"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90030-Y"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.12.013"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.013"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.025"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.03.002"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.11.016"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008994"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.07.017"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/s0129054115500148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T18:05:17Z","timestamp":1565201117000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/s0129054115500148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":11,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2015,5,5]]},"published-print":{"date-parts":[[2015,2]]}},"alternative-id":["10.1142\/s0129054115500148"],"URL":"https:\/\/doi.org\/10.1142\/s0129054115500148","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}