{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T13:57:36Z","timestamp":1775829456667,"version":"3.50.1"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261086"],"award-info":[{"award-number":["12261086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:p> Let [Formula: see text] be a graph with vertex set [Formula: see text] and edge set [Formula: see text]. An edge subset [Formula: see text] is called a restricted edge-cut if [Formula: see text] is disconnected and has no isolated vertices. The restricted edge-connectivity [Formula: see text] of [Formula: see text] is the cardinality of a minimum restricted edge-cut of [Formula: see text] if it has any; otherwise [Formula: see text]. If [Formula: see text] is not a star and its order is at least four, then [Formula: see text], where [Formula: see text]. The graph [Formula: see text] is said to be maximally restricted edge-connected if [Formula: see text]; the graph [Formula: see text] is said to be super restricted edge-connected if every minimum restricted edge-cut isolates an edge from [Formula: see text]. The direct product of graphs [Formula: see text] and [Formula: see text], denoted by [Formula: see text], is the graph with vertex set [Formula: see text], where two vertices [Formula: see text] and [Formula: see text] are adjacent in [Formula: see text] if and only if [Formula: see text] and [Formula: see text]. In this paper, we give a sufficient condition for [Formula: see text] to be super restricted edge-connected, where [Formula: see text] is the complete graph on [Formula: see text] vertices. <\/jats:p>","DOI":"10.1142\/s0129626423500081","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T13:51:57Z","timestamp":1689083517000},"source":"Crossref","is-referenced-by-count":3,"title":["The Super Restricted Edge-connectedness of Direct Product Graphs"],"prefix":"10.1142","volume":"33","author":[{"given":"Minglu","family":"Bai","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1595-9834","authenticated-orcid":false,"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaqiong","family":"Yin","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,7,11]]},"reference":[{"key":"S0129626423500081BIB001","first-page":"45","volume":"41","author":"Bre\u0161ar B.","year":"2008","journal-title":"Australas. J. Combin."},{"issue":"18","key":"S0129626423500081BIB002","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1016\/j.ipl.2011.06.007","volume":"111","author":"Cao X.","year":"2011","journal-title":"Inform. Process. Lett."},{"key":"S0129626423500081BIB003","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"Esfahanian A. H.","year":"1988","journal-title":"Infor. Process. Lett."},{"key":"S0129626423500081BIB004","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"Harary F.","year":"1983","journal-title":"Networks"},{"issue":"3","key":"S0129626423500081BIB005","first-page":"1950012:1","volume":"29","author":"Ma T. L.","year":"2019","journal-title":"Parallel Process. Lett."},{"issue":"12","key":"S0129626423500081BIB006","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1016\/j.disc.2013.02.011","volume":"313","author":"\u0160pacapan S.","year":"2013","journal-title":"Discrete Math."},{"key":"S0129626423500081BIB007","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","volume":"13","author":"Weichsel P. M.","year":"1962","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626423500081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T06:25:51Z","timestamp":1695795951000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626423500081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,11]]},"references-count":7,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["10.1142\/S0129626423500081"],"URL":"https:\/\/doi.org\/10.1142\/s0129626423500081","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,11]]},"article-number":"2350008"}}