{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:52:17Z","timestamp":1775782337090,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100018752","name":"National Institute of Technology Sikkim","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100018752","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115799","type":"journal-article","created":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:31:31Z","timestamp":1770424291000},"page":"115799","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On g-extra connectivity of corona-type graph products"],"prefix":"10.1016","volume":"1070","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8847-7837","authenticated-orcid":false,"given":"Arati","family":"Sharma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0111-4700","authenticated-orcid":false,"given":"Satyam","family":"Guragain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9615-6709","authenticated-orcid":false,"given":"Ravi","family":"Srivastava","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.115799_bib0001","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":"F\u00e0brega","year":"1996","journal-title":"Discr. Math."},{"key":"10.1016\/j.tcs.2026.115799_bib0002","series-title":"Technical Report","article-title":"On the g-Extra Connectivity of Graphs","author":"Wang","year":"2019"},{"key":"10.1016\/j.tcs.2026.115799_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103552","article-title":"The g-extra connectivity of graph products","volume":"145","author":"Wang","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115799_bib0004","series-title":"Technical Report","article-title":"Extra Connectivity of Strong Product of Graphs","author":"Zhu","year":"2023"},{"issue":"9","key":"10.1016\/j.tcs.2026.115799_bib0005","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.ipl.2014.04.003","article-title":"3-extra connectivity of 3-ary n-cube networks","volume":"114","author":"Gu","year":"2014","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115799_bib0006","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":"10.1016\/j.tcs.2026.115799_bib0007","series-title":"Technical Report","article-title":"Extra Connectivity Measures of 3-ary n-Cubes","author":"Zhu","year":"2011"},{"issue":"6","key":"10.1016\/j.tcs.2026.115799_bib0008","doi-asserted-by":"crossref","first-page":"1594","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":"2013","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.tcs.2026.115799_bib0009","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":"10.1016\/j.tcs.2026.115799_bib0010","first-page":"60","article-title":"The g-extra connectivity and diagnosability of crossed cubes","volume":"336","author":"Wang","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2026.115799_bib0011","doi-asserted-by":"crossref","DOI":"10.1088\/1742-6596\/2010\/1\/012094","article-title":"l-extra edge connectivity of graphs","volume":"2010","author":"Li","year":"2021","journal-title":"J. Phys. Conf. Ser."},{"issue":"11","key":"10.1016\/j.tcs.2026.115799_bib0012","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1109\/12.42131","article-title":"Generalized measures of fault tolerance with application to n-cube networks","volume":"38","author":"Esfahanian","year":"2002","journal-title":"IEEE Trans. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:21:48Z","timestamp":1775780508000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":12,"alternative-id":["S0304397526000587"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115799","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On g-extra connectivity of corona-type graph products","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115799","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115799"}}