Component Edge-Connectivity of Generalized K4-Hypercube
Yuxin Rao, Shuming Zhou, Qifan Zhang
Source record
Source: Crossref
Published: May 20, 2026
DOI: 10.1142/s0129626426500088
Open original source ↗Source abstract
With the rapid expansion of data centers driven by big data processing and artificial intelligence, the urgent need is to seek and optimize multiprocessor systems based on interconnection networks with high reliability and strong fault tolerability. The generalized [Formula: see text]-hypercube [Formula: see text], one extended topology derived from the hypercube, is an ideal candidate for the choice of recursive interconnection networks. To quantitatively evaluate its link fault tolerance under multi-component partition scenarios, this paper investigates the [Formula: see text]-component edge-connectivity of [Formula: see text]. This work provides a precise quantitative metric for evaluating the structural robustness of the generalized [Formula: see text]-hypercube [Formula: see text] with a large number of link failures.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.