{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T07:05:16Z","timestamp":1772694316315,"version":"3.50.1"},"reference-count":23,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:p>The connectivity of a network is an important indicator for assessing its reliability and fault-tolerability. In this paper, we study a novel measurement, which is h-faulty-block connectivity. Let G be a connected graph, [Formula: see text] and [Formula: see text] be a connected subgraph. Then, C is called an h-fault-block of G if [Formula: see text] is disconnected, and every component of [Formula: see text] has at least [Formula: see text] nodes with a non-negative integer h. The minimum cardinality over all h-fault-blocks of G is called h-fault-block connectivity of G, denoted by [Formula: see text]. In this paper, we determine [Formula: see text] for n-dimensional balanced hypercube [Formula: see text], a variation of the hypercube. We prove that [Formula: see text] for [Formula: see text], [Formula: see text] for [Formula: see text], and [Formula: see text] for [Formula: see text].<\/jats:p>","DOI":"10.1142\/s0129054125500108","type":"journal-article","created":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T22:27:01Z","timestamp":1742164021000},"page":"307-323","source":"Crossref","is-referenced-by-count":0,"title":["The\n                    <i>h<\/i>\n                    -Faulty-Block Connectivity of\n                    <i>n<\/i>\n                    -Dimensional Balanced Hypercube"],"prefix":"10.1142","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3255-3316","authenticated-orcid":false,"given":"Qin","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1215-3616","authenticated-orcid":false,"given":"Xiaohui","family":"Hua","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"S0129054125500108BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129054125500108BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.11.008"},{"key":"S0129054125500108BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.05.037"},{"key":"S0129054125500108BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.08.003"},{"key":"S0129054125500108BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00369-T"},{"key":"S0129054125500108BIB006","first-page":"45","volume":"140","author":"Gu M.-M.","year":"2018","journal-title":"Ars Combinatoria"},{"key":"S0129054125500108BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.07.015"},{"key":"S0129054125500108BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.05.006"},{"key":"S0129054125500108BIB009","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.48.7.1142"},{"key":"S0129054125500108BIB010","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.2913.35e"},{"key":"S0129054125500108BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3023120"},{"key":"S0129054125500108BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.030"},{"key":"S0129054125500108BIB013","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2016.1148813"},{"key":"S0129054125500108BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.09.020"},{"key":"S0129054125500108BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.12.011"},{"key":"S0129054125500108BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/12.588063"},{"key":"S0129054125500108BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.12.036"},{"key":"S0129054125500108BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.06.077"},{"key":"S0129054125500108BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2017.10.005"},{"key":"S0129054125500108BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.08.014"},{"key":"S0129054125500108BIB021","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054121500088"},{"key":"S0129054125500108BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/CIBDA50819.2020.00072"},{"key":"S0129054125500108BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2304391"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054125500108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T06:11:54Z","timestamp":1772691114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054125500108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":23,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["10.1142\/S0129054125500108"],"URL":"https:\/\/doi.org\/10.1142\/s0129054125500108","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,13]]}}}