{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T13:57:35Z","timestamp":1775829455935,"version":"3.50.1"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11601254"],"award-info":[{"award-number":["11601254"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11661068"],"award-info":[{"award-number":["11661068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61763041"],"award-info":[{"award-number":["61763041"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11551001"],"award-info":[{"award-number":["11551001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science Foundation of Qinghai Province","award":["2019-ZJ-921"],"award-info":[{"award-number":["2019-ZJ-921"]}]},{"name":"Excellent Youth Foundation of Qinghai University","award":["2017-QGY-8"],"award-info":[{"award-number":["2017-QGY-8"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:p> The restricted edge-connectivity of a connected graph [Formula: see text], denoted by [Formula: see text], if exists, is the minimum number of edges whose deletion disconnects the graph such that each connected component has at least two vertices. The Kronecker 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, it is proved that [Formula: see text] for any graph [Formula: see text] and a complete graph [Formula: see text] with [Formula: see text] vertices, where [Formula: see text] is minimum edge-degree of [Formula: see text], and a sufficient condition such that [Formula: see text] is [Formula: see text]-optimal is acquired. <\/jats:p>","DOI":"10.1142\/s0129626419500129","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T04:13:50Z","timestamp":1569903230000},"page":"1950012","source":"Crossref","is-referenced-by-count":6,"title":["The Restricted Edge-Connectivity of Kronecker Product Graphs"],"prefix":"10.1142","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9723-9055","authenticated-orcid":false,"given":"Tianlong","family":"Ma","sequence":"first","affiliation":[{"name":"Department of Basic Research, Qinghai University, Xining, Qinghai, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinling","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University, Lanzhou, Gansu, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,10,1]]},"reference":[{"key":"S0129626419500129BIB001","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20194"},{"key":"S0129626419500129BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129626419500129BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00145-8"},{"key":"S0129626419500129BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103438358"},{"key":"S0129626419500129BIB005","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1365"},{"key":"S0129626419500129BIB006","first-page":"45","volume":"1","author":"Bre\u0161r B.","year":"2008","journal-title":"Australas. J. Combin."},{"key":"S0129626419500129BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.06.007"},{"key":"S0129626419500129BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.12.003"},{"key":"S0129626419500129BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90025-7"},{"key":"S0129626419500129BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/S0895-7177(99)00173-9"},{"key":"S0129626419500129BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2009.03.008"},{"key":"S0129626419500129BIB012","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.056107"},{"key":"S0129626419500129BIB013","volume-title":"Product Graphs: Structure and Recognition","author":"Imrich W.","year":"2000"},{"key":"S0129626419500129BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557108000102"},{"key":"S0129626419500129BIB015","first-page":"1119","volume":"5","author":"Lammprey R. H.","year":"1974","journal-title":"Modeling and Simulation"},{"key":"S0129626419500129BIB016","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H"},{"key":"S0129626419500129BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.12.002"},{"key":"S0129626419500129BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.038"},{"key":"S0129626419500129BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.06.010"},{"key":"S0129626419500129BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0919-8"},{"key":"S0129626419500129BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.11.010"},{"key":"S0129626419500129BIB022","first-page":"235","volume":"95","author":"Xu J. M.","year":"2010","journal-title":"Ars Combin."},{"key":"S0129626419500129BIB023","doi-asserted-by":"publisher","DOI":"10.1002\/net.20231"},{"key":"S0129626419500129BIB024","first-page":"3","volume":"111","author":"Yang C.","year":"2013","journal-title":"Ars Combin."}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626419500129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T04:14:37Z","timestamp":1569903277000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626419500129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":24,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.1142\/S0129626419500129"],"URL":"https:\/\/doi.org\/10.1142\/s0129626419500129","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}