Component edge-connectivity of generalized K4-hypercubes with large-scale faulty links

Assessing the reliability of multiprocessor systems is crucial for the design and maintenance of multiprocessor systems. As more processing units are rapidly integrated into emerging multiprocessor systems, a growing number of refined metrics based on edge-connectivity have been introduced to assess the reliability of multiprocessor systems. One generalization is the component edge-connectivity, presented by Sampathkumar. The generalized K4-hypercubes, which are constructed by Brudnak and Lipták through repeatedly and randomly adding a perfect matching between two lower copies from K4, possess remarkable properties. In this paper, for n≥11,1≤r≤2⌈n/2⌉+1, the (r+1)-component edge-connectivity of the n-dimensional K4-hypercube is obtained.

Authors

Institutions

Publication Details

Journal
Journal of the Chinese Institute of Engineers
Published
2026-09-29
DOI
https://doi.org/10.1080/02533839.2026.2710677
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Component edge-connectivity of generalized K4-hypercubes with large-scale faulty links

Xianglan Cao, Mingzu Zhang, Eddie Cheng, Yan Wu et al.
Journal of the Chinese Institute of Engineers
Interconnection Networks and Systems
article

Component edge-connectivity of generalized K4-hypercubes with large-scale faulty links

Xianglan Cao, Mingzu Zhang, Eddie Cheng, Yan Wu, Shuqian Cheng
article en

Abstract

Assessing the reliability of multiprocessor systems is crucial for the design and maintenance of multiprocessor systems. As more processing units are rapidly integrated into emerging multiprocessor systems, a growing number of refined metrics based on edge-connectivity have been introduced to assess the reliability of multiprocessor systems. One generalization is the component edge-connectivity, presented by Sampathkumar. The generalized K4-hypercubes, which are constructed by Brudnak and Lipták through repeatedly and randomly adding a perfect matching between two lower copies from K4, possess remarkable properties. In this paper, for n≥11,1≤r≤2⌈n/2⌉+1, the (r+1)-component edge-connectivity of the n-dimensional K4-hypercube is obtained.

Journal of the Chinese Institute of Engineers
Shihezi University (CN), Oakland University (US), Xinjiang University (CN)
Openalex Percentile: Top 9%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Component edge-connectivity of generalized K4-hypercubes with large-scale faulty links — Xianglan Cao, Mingzu Zhang, et al. · Journal of the Chinese Institute of Engineers (2026) | TGRS Research Map | TGRS