{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:20:42Z","timestamp":1648977642208},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:p> The local connectivity of two vertices is defined as the maximum number of internally vertex-disjoint paths between them. In this paper, we define two vertices as maximally local-connected, if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. Moreover, we show that an (n-1)-regular Cayley graph generated by transposition tree is maximally local-connected, even if there are at most (n-3) faulty vertices in it, and prove that it is also (n-1)-fault-tolerant one-to-many maximally local-connected. <\/jats:p>","DOI":"10.1142\/s021926590900256x","type":"journal-article","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T15:33:52Z","timestamp":1253720032000},"page":"253-260","source":"Crossref","is-referenced-by-count":9,"title":["FAULT-TOLERANT MAXIMAL LOCAL-CONNECTIVITY ON CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES"],"prefix":"10.1142","volume":"10","author":[{"given":"LUN-MIN","family":"SHIH","sequence":"first","affiliation":[{"name":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30050, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHIEH-FENG","family":"CHIANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30050, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LIH-HSING","family":"HSU","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Providence University, Taichung, Taiwan 43301, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JIMMY J. M.","family":"TAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30050, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"rf2","volume-title":"Graph theory with applications","author":"Bondy J. A.","year":"1980"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.034"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19600220107"},{"key":"rf5","first-page":"95","volume":"10","author":"Menger K.","journal-title":"Fund. Math."},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00600-5"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265903000763"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.009"},{"key":"rf10","first-page":"115","volume":"14","author":"Tchuente M.","journal-title":"Ars Combinatoria"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2006.12.014"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021926590900256X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:57:44Z","timestamp":1565114264000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021926590900256X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1142\/S021926590900256X"],"URL":"https:\/\/doi.org\/10.1142\/s021926590900256x","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}