{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T02:48:18Z","timestamp":1771642098858,"version":"3.50.1"},"reference-count":27,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T00:00:00Z","timestamp":1662854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861066"],"award-info":[{"award-number":["11861066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Let G be a connected graph and g be a non-negative integer. A vertex set S of graph G is called a g-extra cut if G\u2212S is disconnected and each component of G\u2212S has at least g+1 vertices. The g-extra connectivity of G is the minimum cardinality of a g-extra cut of G if G has at least one g-extra cut. For two graphs G1=(V1,E1) and G2=(V2,E2), the strong product G1\u22a0G2 is defined as follows: its vertex set is V1\u00d7V2 and its edge set is {(x1,x2)(y1,y2)|x1=x2 and y1y2\u2208E2; or y1=y2 and x1x2\u2208E1; or x1x2\u2208E1 and y1y2\u2208E2}, where (x1,x2),(y1,y2)\u2208V1\u00d7V2. In this paper, we obtain the g-extra connectivity of the strong product of two paths, the strong product of a path and a cycle, and the strong product of two cycles.<\/jats:p>","DOI":"10.3390\/sym14091900","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T22:37:28Z","timestamp":1663108648000},"page":"1900","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The g-Extra Connectivity of the Strong Product of Paths and Cycles"],"prefix":"10.3390","volume":"14","author":[{"given":"Qinze","family":"Zhu","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, 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 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","article-title":"Conditional connectivity","volume":"13","author":"Harary","year":"1983","journal-title":"Networks"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","article-title":"On the extraconnectivity of graphs","volume":"155","author":"Fiol","year":"1996","journal-title":"Discret. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1109\/TC.2013.10","article-title":"On 3-extra connectivity and 3-extra edge connectivity of folded hypercubes","volume":"63","author":"Chang","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","article-title":"Synthesis of reliable networks\u2014A survey","volume":"35","author":"Boesch","year":"1986","journal-title":"IEEE Trans. Reliab."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","article-title":"On computing a conditional edge-connectivity of a graph","volume":"27","author":"Esfahanian","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jpdc.2022.04.014","article-title":"The g-extra connectivity of folded crossed cubes","volume":"166","author":"Guo","year":"2022","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2012.03.030","article-title":"Extraconnectivity of k-ary n-cube networks","volume":"443","author":"Hsieh","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.tcs.2015.11.050","article-title":"{2,3}-restricted connectivity of locally twisted cubes","volume":"615","author":"Hsieh","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/12.262126","article-title":"Conditional connectivity measures for large multiprocessor systems","volume":"43","author":"Latifi","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1080\/00207160.2015.1067690","article-title":"The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes","volume":"93","author":"Lin","year":"2016","journal-title":"Int. J. Comput. Math."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.aml.2008.03.021","article-title":"A kind of conditional vertex connectivity of star graphs","volume":"22","author":"Wan","year":"2009","journal-title":"Appl. Math. Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.dam.2015.09.002","article-title":"The restricted h-connectivity of the data center network DCell","volume":"203","author":"Wang","year":"2016","journal-title":"Discret. Appl. Math."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2020.12.011","article-title":"The reliability analysis based on the generalized connectivity in balanced hypercubes","volume":"292","author":"Wei","year":"2021","journal-title":"Discret. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.dam.2016.08.012","article-title":"h-restricted connectivity of locally twisted cubes","volume":"217","author":"Wei","year":"2017","journal-title":"Discret. Appl. Math."},{"key":"ref_15","first-page":"464","article-title":"On extra connectivity and extra edge-connectivity of balanced hypercubes","volume":"320","author":"Yang","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2540","DOI":"10.1109\/TC.2013.128","article-title":"Reliability evaluation of BC networks in terms of the extra vertex-and edge-connectivity","volume":"63","author":"Yang","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.aml.2008.07.016","article-title":"Extraconnectivity of hypercubes","volume":"22","author":"Yang","year":"2009","journal-title":"Appl. Math. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.tcs.2015.06.008","article-title":"On g-extra connectivity of folded hypercubes","volume":"593","author":"Zhang","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.jcss.2017.04.002","article-title":"On g-extra connectivity of hypercube-like networks","volume":"88","author":"Zhou","year":"2017","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2337","DOI":"10.1109\/TC.2012.106","article-title":"Reliability Evaluation of BC Networks","volume":"62","author":"Zhu","year":"2013","journal-title":"IEEE Trans. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.aml.2007.06.010","article-title":"Connectivity of Cartesian products of graphs","volume":"21","year":"2008","journal-title":"Appl. Math. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/net.20224","article-title":"On super connectivity of Cartesian product graphs","volume":"52","author":"Wu","year":"2008","journal-title":"Networks"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1727","DOI":"10.1007\/s00373-014-1437-x","article-title":"Restricted connectivity for some interconnection networks","volume":"31","author":"Tian","year":"2015","journal-title":"Graphs Comb."},{"key":"ref_24","first-page":"58","article-title":"Restricted connectivity of Cartesian product graphs","volume":"46","author":"Chen","year":"2016","journal-title":"IAENG Int. J. Appl. Math."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"333","DOI":"10.7151\/dmgt.1365","article-title":"Edge-connectivity of strong products of graphs","volume":"27","year":"2007","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s00373-010-0919-8","article-title":"Connectivity of Strong Products of Graphs","volume":"26","year":"2010","journal-title":"Graphs Comb."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Graduate Texts in Mathematics 244, Springer.","DOI":"10.1007\/978-1-84628-970-5"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/9\/1900\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:29:29Z","timestamp":1760142569000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/9\/1900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,11]]},"references-count":27,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["sym14091900"],"URL":"https:\/\/doi.org\/10.3390\/sym14091900","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,11]]}}}