{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T10:59:15Z","timestamp":1785149955455,"version":"3.55.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s12190-026-02846-4","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T15:07:34Z","timestamp":1781622454000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A characterization of 3-extra-cut sets for bipartite hierarchical graph*"],"prefix":"10.1007","volume":"72","author":[{"given":"Wen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaomin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,16]]},"reference":[{"issue":"3","key":"2846_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"F. Harary","year":"1983","unstructured":"Harary, F.: Conditional connectivity. Networks 13(3), 347\u2013357 (1983). https:\/\/doi.org\/10.1002\/net.3230130303","journal-title":"Networks"},{"issue":"1\u20133","key":"2846_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","volume":"155","author":"J. F\u00e0brega","year":"1996","unstructured":"F\u00e0brega, J., Fiol, M.A.: On the extraconnectivity of graphs. Discrete Math. 155(1\u20133), 49\u201357 (1996). https:\/\/doi.org\/10.1016\/0012-365X(94)00369-T","journal-title":"Discrete Math."},{"issue":"9","key":"2846_CR3","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1093\/comjnl\/bxaa058","volume":"64","author":"H. Zhang","year":"2021","unstructured":"Zhang, H., Meng, J.: Reliability of dqcube based on g-extra conditional fault. Comput. J. 64(9), 1393\u20131400 (2021). https:\/\/doi.org\/10.1093\/comjnl\/bxaa058","journal-title":"Comput. J."},{"key":"2846_CR4","unstructured":"Hu, X., Jia, S., Yang, W.: A characterization of 1, 2-extra-cut set for hierarchical graph. Available at SSRN 5193978"},{"issue":"9","key":"2846_CR5","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.3390\/math13091532","volume":"13","author":"E. Sabir","year":"2025","unstructured":"Sabir, E., Lin, C.-K.: Structure fault tolerance of fully connected cubic networks. Mathematics 13(9), 1532 (2025)","journal-title":"Mathematics"},{"key":"2846_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2019.09.035","volume":"799","author":"E. Sabir","year":"2019","unstructured":"Sabir, E., Mamut, A., Vumar, E.: The extra connectivity of the enhanced hypercubes. Theor. Comput. Sci. 799, 22\u201331 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.035","journal-title":"Theor Comput Sci."},{"key":"2846_CR7","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2017.10.032","volume":"711","author":"E. Sabir","year":"2018","unstructured":"Sabir, E., Meng, J.: Structure fault tolerance of hypercubes and folded hypercubes. Theor. Comput. Sci. 711, 44\u201355 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.10.032","journal-title":"Theor Comput Sci."},{"issue":"3","key":"2846_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/17445760.2020.1748188","volume":"36","author":"H. Zhang","year":"2021","unstructured":"Zhang, H., Meng, J.: Faulty diagnosability and g-extra connectivity of dqcube. Int. J. Parallel Emergent Distrib. Syst. 36(3), 189\u2013198 (2021). https:\/\/doi.org\/10.1080\/17445760.2020.1748188","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"2846_CR9","unstructured":"Zhang, H., Zhou, S., Cheng, E.: Restricted (edge) connectivity of cayley graph generated by transposition trees. Available at SSRN 4034465"},{"key":"2846_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zhou, S., Zhenqin, Y., Liu, X.: Extra (component) connectivity and diagnosability of bubble sort networks. In: 2021 IEEE 21st International Conference on Software Quality, Reliability and Security Companion, pp. 865\u2013871. IEEE (2021)","DOI":"10.1109\/QRS-C55045.2021.00131"},{"key":"2846_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2012.03.030","volume":"443","author":"S.-Y. Hsieh","year":"2012","unstructured":"Hsieh, S.-Y., Chang, Y.-H.: Extraconnectivity of k-ary n-cube networks. Theor. Comput. Sci. 443, 63\u201369 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.030","journal-title":"Theor Comput Sci."},{"issue":"9","key":"2846_CR12","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.ipl.2014.04.003","volume":"114","author":"M.-M. Gu","year":"2014","unstructured":"Gu, M.-M., Hao, R.-X.: 3-extra connectivity of 3-ary n-cube networks. Inf. Process. Lett. 114(9), 486\u2013491 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2014.04.003","journal-title":"Inf Process Lett."},{"key":"2846_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2021.07.029","volume":"888","author":"J. Liu","year":"2021","unstructured":"Liu, J., Zhou, S., Cheng, E., Zhou, Q., Liu, X.: Reliability analysis of the cactus-based networks. Theor. Comput. Sci. 888, 95\u2013107 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.029","journal-title":"Theor Comput Sci."},{"issue":"2","key":"2846_CR14","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/TR.2019.2919282","volume":"69","author":"M. Lv","year":"2020","unstructured":"Lv, M., Zhou, S., Chen, G., Chen, L., Liu, J., Chang, C.-C.: On reliability of multiprocessor system based on star graph. IEEE Trans. Rel. 69(2), 715\u2013724 (2020). https:\/\/doi.org\/10.1109\/TR.2019.2919282","journal-title":"IEEE Trans. Rel."},{"key":"2846_CR15","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Chen, J., Lili, L.: The h-extra connectivity of the star graph networks. In: 2017 First International Conference on Electronics Instrumentation & Information Systems (EIIS), pp. 1\u20136. IEEE (2017)","DOI":"10.1109\/EIIS.2017.8298665"},{"issue":"5","key":"2846_CR16","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1142\/S0129054107005108","volume":"18","author":"E. Cheng","year":"2007","unstructured":"Cheng, E., Liptak, L.: Fault resiliency of cayley graphs generated by transpositions. Int. J. Found. Comput. Sci. 18(5), 1005\u20131022 (2007). https:\/\/doi.org\/10.1142\/S0129054107005108","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"2846_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.aml.2008.03.021","volume":"22","author":"M. Wan","year":"2009","unstructured":"Wan, M., Zhang, Z.: A kind of conditional vertex connectivity of star graphs. Appl. Math. Lett. 22(2), 264\u2013267 (2009). https:\/\/doi.org\/10.1016\/j.aml.2008.03.021","journal-title":"Appl. Math. Lett."},{"key":"2846_CR18","unstructured":"Xu, J.: Combination of network theory. Science Press, Beijing (2013)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02846-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02846-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02846-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T10:02:05Z","timestamp":1785146525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02846-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,16]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["2846"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02846-4","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,16]]},"assertion":[{"value":"17 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"190"}}