{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:24:15Z","timestamp":1753885455038,"version":"3.41.2"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:p> Let [Formula: see text] be a graph. A vertex-cut [Formula: see text] of [Formula: see text] is said to be k-restricted if every component of [Formula: see text] has at least [Formula: see text] vertices, and cyclic if [Formula: see text] has at least two components which contain a cycle. The minimum cardinality over all [Formula: see text]-restricted vertex-cuts of [Formula: see text] is called the k-restricted connectivity of [Formula: see text] and is denoted by [Formula: see text]. Also the minimum cardinality over all cyclic vertex-cuts of [Formula: see text] is called the cyclic connectivity of graph [Formula: see text] and is denoted by [Formula: see text]. In this paper, the [Formula: see text]-restricted connectivity and cyclic connectivity of the direct product of two graphs [Formula: see text] and [Formula: see text] is obtained for some [Formula: see text], where [Formula: see text] is a complete graph, and [Formula: see text] is a complete graph, a complete bipartite graph or a cycle. <\/jats:p>","DOI":"10.1142\/s1793830922501750","type":"journal-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T15:49:23Z","timestamp":1666280963000},"source":"Crossref","is-referenced-by-count":0,"title":["On k-restricted connectivity of direct product of graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Huiwen","family":"Cheng","sequence":"first","affiliation":[{"name":"Department of Mathematics, Haidian Adult University, Beijing 100083, P. R. China"}]},{"given":"Rezvan","family":"Varmazyar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Khoy Branch, Islamic Azad University, Khoy 58168-44799, Iran"}]},{"given":"Mohsen","family":"Ghasemi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Urmia University, Urmia 57135, Iran"}]}],"member":"219","published-online":{"date-parts":[[2023,2,8]]},"reference":[{"key":"S1793830922501750BIB001","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."},{"volume-title":"Graph Theory with Applications","year":"1967","author":"Bondy J. A.","key":"S1793830922501750BIB002"},{"issue":"8","key":"S1793830922501750BIB003","first-page":"1","volume":"73","author":"Cheng E.","year":"2017","journal-title":"J. Super Comput."},{"issue":"16","key":"S1793830922501750BIB004","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ipl.2010.05.013","volume":"110","author":"Guo L.","year":"2010","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"S1793830922501750BIB005","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.aml.2012.04.006","volume":"26","author":"Guo L.","year":"2013","journal-title":"Appl. Math. Lett."},{"key":"S1793830922501750BIB007","first-page":"985","volume":"11","author":"Leskovec J.","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"S1793830922501750BIB008","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.dam.2020.04.030","volume":"285","author":"Lee C.-W.","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"S1793830922501750BIB009","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.tcs.2020.10.036","volume":"850","author":"Lia X. W.","year":"2021","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"S1793830922501750BIB010","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1080\/00207160.2015.1067690","volume":"93","author":"Lin R.","year":"2016","journal-title":"Int. J. Comput. Math."},{"key":"S1793830922501750BIB011","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/net.20224","volume":"52","author":"L\u00fc M.","year":"2008","journal-title":"Networks"},{"issue":"2","key":"S1793830922501750BIB012","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ipl.2007.10.005","volume":"106","author":"Ma M.","year":"2008","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"S1793830922501750BIB013","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1051\/ro\/2022085","volume":"56","author":"Soliemany F.","year":"2022","journal-title":"Rairo-Oper. Res."},{"issue":"1","key":"S1793830922501750BIB014","first-page":"1","volume":"7","author":"Soliemany F.","year":"2021","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"S1793830922501750BIB015","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.dam.2015.09.002","volume":"203","author":"Wang X.","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"S1793830922501750BIB016","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.dam.2016.08.012","volume":"217","author":"Wei C.-C.","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"S1793830922501750BIB017","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. Am. Math. Soc."},{"volume-title":"Topological Structure and Analysis of Interconnection Networks","year":"2001","author":"Xu J. M.","key":"S1793830922501750BIB018"},{"issue":"4","key":"S1793830922501750BIB019","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ipl.2005.02.001","volume":"94","author":"Xu J. M.","year":"2005","journal-title":"Inf. Process. Lett."},{"key":"S1793830922501750BIB020","doi-asserted-by":"crossref","first-page":"235","DOI":"10.26493\/1855-3974.352.7de","volume":"8","author":"Zhou J.-X.","year":"2015","journal-title":"Ars. Math. Contemp."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T02:55:32Z","timestamp":1692068132000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,8]]},"references-count":19,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["10.1142\/S1793830922501750"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501750","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,2,8]]},"article-number":"2250175"}}