{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:29Z","timestamp":1740155969714,"version":"3.37.3"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> For a strongly connected digraph [Formula: see text], an arc-cut [Formula: see text] is a [Formula: see text]-restricted arc-cut of [Formula: see text] if [Formula: see text] has at least two strong components of order at least [Formula: see text]. The [Formula: see text]-restricted arc-connectivity [Formula: see text] is the minimum cardinality of all [Formula: see text]-restricted arc-cuts. The [Formula: see text]-restricted vertex-connectivity [Formula: see text] can be defined similarly. In this paper, we provide upper and lower bounds for [Formula: see text] and [Formula: see text] for the total digraph [Formula: see text] of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830916500221","type":"journal-article","created":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T03:00:05Z","timestamp":1453345205000},"page":"1650022","source":"Crossref","is-referenced-by-count":0,"title":["Restricted connectivity of total digraph"],"prefix":"10.1142","volume":"08","author":[{"given":"Zhenhua","family":"Liu","sequence":"first","affiliation":[{"name":"Shihezi No. 1 Middle School, Shihezi, Xinjiang 832000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"S1793830916500221BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830916500221BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90025-7"},{"key":"S1793830916500221BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9395-1"},{"key":"S1793830916500221BIB004","first-page":"97","volume":"87","author":"Liu J.","year":"2008","journal-title":"Ars Comb."},{"key":"S1793830916500221BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10255-005-0283-2"},{"key":"S1793830916500221BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.04.004"},{"key":"S1793830916500221BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.07.008"},{"key":"S1793830916500221BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"S1793830916500221BIB009","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.883069"},{"key":"S1793830916500221BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2010.03.013"},{"issue":"2","key":"S1793830916500221BIB011","first-page":"107","volume":"43","author":"Zhu Y. F.","year":"2010","journal-title":"J. Math. Study"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:42:06Z","timestamp":1568940126000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":11,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,26]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S1793830916500221"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500221","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2016,5,26]]}}}