{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:57:36Z","timestamp":1772823456660,"version":"3.50.1"},"reference-count":20,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:p>Restricted arc-connectivity is a more refined network reliability index than arc-connectivity. An arc subset [Formula: see text] of a strong digraph [Formula: see text] is a restricted arc-cut of [Formula: see text] if [Formula: see text] has a non-trivial strong component [Formula: see text] such that [Formula: see text] contains an arc. The restricted arc-connectivity is the minimum cardinality over all restricted arc-cuts of [Formula: see text]. A strong digraph is super-[Formula: see text] if its restricted arc-connectivity is maximal and the number of its minimum restricted arc-cuts is minimal. In this paper, we present some neighborhood conditions for a digraph to be super-[Formula: see text].<\/jats:p>","DOI":"10.1142\/s0219265921420135","type":"journal-article","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T15:13:49Z","timestamp":1629126829000},"source":"Crossref","is-referenced-by-count":1,"title":["Neighborhood Conditions for Super-\u03bb\u2032 Digraphs"],"prefix":"10.1142","volume":"22","author":[{"given":"Shangwei","family":"Lin","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, P. R. China"}]},{"given":"Ruixin","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, P. R. China"}]},{"given":"Shuyu","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2021,8,13]]},"reference":[{"key":"S0219265921420135BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10114-010-9313-y"},{"key":"S0219265921420135BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.02.006"},{"key":"S0219265921420135BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/net.21462"},{"issue":"15","key":"S0219265921420135BIB004","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.amc.2018.02.038","volume":"331","author":"Balbuena C.","year":"2018","journal-title":"Appl. Math Comput."},{"key":"S0219265921420135BIB005","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen J.","year":"2000"},{"key":"S0219265921420135BIB006","first-page":"45","volume-title":"The Theory and Application of Graphs","author":"Bauer D.","year":"1981"},{"key":"S0219265921420135BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.08.005"},{"key":"S0219265921420135BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.05.003"},{"key":"S0219265921420135BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90025-7"},{"key":"S0219265921420135BIB010","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190160603"},{"key":"S0219265921420135BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.02.010"},{"key":"S0219265921420135BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.01.028"},{"key":"S0219265921420135BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.06.035"},{"key":"S0219265921420135BIB014","first-page":"148","volume":"274","author":"Jolivet J. L.","year":"1972","journal-title":"C. R. Acad. Sci. Paris A"},{"key":"S0219265921420135BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.02.014"},{"key":"S0219265921420135BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.04.004"},{"key":"S0219265921420135BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.012"},{"key":"S0219265921420135BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.07.008"},{"key":"S0219265921420135BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.027"},{"key":"S0219265921420135BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90102-7"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921420135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T12:18:31Z","timestamp":1699359511000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921420135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,13]]},"references-count":20,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["10.1142\/S0219265921420135"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921420135","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,13]]},"article-number":"2142013"}}