{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:53:56Z","timestamp":1778597636446,"version":"3.51.4"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T00:00:00Z","timestamp":1729296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,2,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The connectivity of a network is an important indicator for assessing its reliability and fault tolerability. However, currently various kinds of connectivity do not well reflect the network\u2019s fault tolerance when facing certain attacks such as Botnet attacks, DDoS attacks, and Local Area Network Denial attacks. Therefore, Lin et\u00a0al. (A novel measurement for network reliability. IEEE Trans Comput 2021; 70: 17191731.) proposed a new measurement for network reliability. This measurement method can resist the block attack by taking into account of the dispersity of the remaining nodes. Let $G$ be a network, $C \\subset V(G)$, and $G[C]$ be a connected subgraph. Then $C$ is called an $h$-faulty-block of $G$ if $G-C$ is disconnected, and every component of $G-C$ has at least $h+1$ nodes. The minimum cardinality over all $h$-faulty-block of $G$ is called $h$-faulty-block connectivity, denoted by $FB_{k_{h}}(G)$. In this paper, we determine $FB_{k_{h}}(Q_{n}^{k})$ for $k$-ary $n$-cube $Q_{n}^{k}$ ($k\\geq 3$), a classic interconnection network. We prove that $FB_{k_{0}}(Q_{n}^{3})=3n-1$, $FB_{k_{1}}(Q_{n}^{3})=5n-4$, and $FB_{k_{2}}(Q_{n}^{3})=7n-9$ for $n\\geq 3$. Also, we show that $FB_{k_{0}}(Q_{n}^{k})=4n-1$ for $k\\geq 4$ and $n\\geq 2$, $FB_{k_{1}}(Q_{n}^{4})=6n-4$ for $n\\geq 3$, $FB_{k_{1}}(Q_{n}^{k})=6n-3$ for $k\\geq 5$ and $n\\geq 3$, $FB_{k_{2}}(Q_{n}^{4})=8n-7$ for $n\\geq 4$, $FB_{k_{2}}(Q_{n}^{5})=8n-6$ for $n\\geq 4$, and $FB_{k_{2}}(Q_{n}^{k})=8n-5$ for $k\\geq 6$ and $n\\geq 5$.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae098","type":"journal-article","created":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T03:38:38Z","timestamp":1729481918000},"page":"126-134","source":"Crossref","is-referenced-by-count":1,"title":["The <i>h<\/i>-faulty-block connectivity of <i>k<\/i>-ary <i>n<\/i>-cubes"],"prefix":"10.1093","volume":"68","author":[{"given":"Xiaohui","family":"Hua","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University , Xinxiang, Henan 453007 ,","place":["PR China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University , Xinxiang, Henan 453007 ,","place":["PR China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,10,19]]},"reference":[{"key":"2025021705263850000_ref1","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","article-title":"The maximum connectivity of a graph","volume":"48","author":"Harary","year":"1962","journal-title":"Proc Natl Acad Sci"},{"key":"2025021705263850000_ref2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/12.262126","article-title":"Conditional connectivity measures for large multiprocessor systems","volume":"43","author":"Latifi","year":"1994","journal-title":"IEEE Trans Comput"},{"key":"2025021705263850000_ref3","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.ipl.2011.07.017","article-title":"Conditional fault tolerance of arrangement graphs","volume":"111","author":"Zhou","year":"2011","journal-title":"Inf Process Lett"},{"key":"2025021705263850000_ref4","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/j.aml.2011.11.040","article-title":"Generalized measures of fault tolerance in hypercube networks","volume":"25","author":"Yang","year":"2012","journal-title":"Appl Math Lett"},{"key":"2025021705263850000_ref5","doi-asserted-by":"publisher","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":"2025021705263850000_ref6","doi-asserted-by":"publisher","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":"2025021705263850000_ref7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2019.03.030","article-title":"The h-extra connectivity of k-ary n-cubes","volume":"784","author":"Liu","year":"2019","journal-title":"Theor Comput Sci"},{"key":"2025021705263850000_ref8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2020.05.006","article-title":"Relationship between the extra edge connectivity and component edge connectivity for regular graphs","volume":"833","author":"Hao","year":"2020","journal-title":"Theor Comput Sci"},{"key":"2025021705263850000_ref9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2016.04.014","article-title":"Structure connectivity and substructure connectivity of hypercubes","volume":"634","author":"Lin","year":"2016","journal-title":"Theor Comput Sci"},{"key":"2025021705263850000_ref10","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1093\/comjnl\/bxy115","article-title":"Characterizations of minimum structure- and substructure-cuts of hypercubes","volume":"62","author":"Yang","year":"2019","journal-title":"Comput J"},{"key":"2025021705263850000_ref11","doi-asserted-by":"publisher","first-page":"9157","DOI":"10.1007\/s11227-022-05036-8","article-title":"On structure and substructure fault tolerance of star networks","volume":"79","author":"Yang","year":"2023","journal-title":"J Supercomput"},{"key":"2025021705263850000_ref12","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1109\/TC.2020.3023120","article-title":"A novel measurement for network reliability","volume":"70","author":"Lin","year":"2021","journal-title":"IEEE Trans Comput"},{"key":"2025021705263850000_ref13","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1093\/comjnl\/bxp027","article-title":"The Bipancycle-connectivity and the m-Pancycle-connectivity of the k-ary n-cube","volume":"53","author":"Fang","year":"2010","journal-title":"Comput J"},{"key":"2025021705263850000_ref14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20290","article-title":"Panconnectivity and edge-pancyclicity ofk-ary n-cubes","volume":"54","author":"Hsieh","year":"2009","journal-title":"Networks"},{"key":"2025021705263850000_ref15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TPDS.2008.45","article-title":"Bipanconnectivity and Bipancyclicity in k-ary n-cubes","volume":"20","author":"Stewart","year":"2009","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2025021705263850000_ref16","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1109\/TPDS.2011.22","article-title":"Bipancyclicity in k-Ary n-cubes with faulty edges under a conditional fault assumption","volume":"22","author":"Xiang","year":"2011","journal-title":"IEEE Trans. Parallel Distrib."},{"key":"2025021705263850000_ref17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ins.2017.11.047","article-title":"Structure connectivity and substructure connectivity of k-ary n-cube networks","volume":"433-434","author":"Lv","year":"2018","journal-title":"Inform. Sci."},{"key":"2025021705263850000_ref18","doi-asserted-by":"publisher","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":"Information Processing Letters"},{"key":"2025021705263850000_ref19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2016.06.043","article-title":"The extra connectivity of bubble-sort star graphs","volume":"645","author":"Guo","year":"2016","journal-title":"Theoretical Computer Science"},{"key":"2025021705263850000_ref20","doi-asserted-by":"publisher","first-page":"2352","DOI":"10.1109\/TPDS.2014.2347961","article-title":"The extra connectivity and conditional diagnosability of alternating group networks","volume":"26","author":"Lin","year":"2015","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2025021705263850000_ref21","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1080\/00207160.2016.1148813","article-title":"On extra connectivity and extra edge-connectivity of balanced hypercubes","volume":"94","author":"L\u00fc","year":"2017","journal-title":"International Journal of Computer Mathematics"},{"key":"2025021705263850000_ref22","doi-asserted-by":"publisher","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":"Discrete Mathematics"},{"key":"2025021705263850000_ref23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0045-7906(99)00003-8","article-title":"The k-ary n-cube network: Modeling, topological properties and routing strategies","volume":"25","author":"Ghozati","year":"1999","journal-title":"Comput. Electr. Eng."},{"key":"2025021705263850000_ref24","doi-asserted-by":"publisher","first-page":"125237","DOI":"10.1016\/j.amc.2020.125237","article-title":"Neighbor connectivity of k-ary n-cubes","volume":"379","author":"Dvor\u00e1k","year":"2020","journal-title":"Appl. Math Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/2\/126\/59899713\/bxae098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/2\/126\/59899713\/bxae098.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T05:26:46Z","timestamp":1739770006000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/2\/126\/7828053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,19]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,10,19]]},"published-print":{"date-parts":[[2025,2,9]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae098","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,2]]},"published":{"date-parts":[[2024,10,19]]}}}