Embedded connectivity of recursive networks
Xiang-Jun Li, Qi-Qi Dong, Zheng Yan, Jun-Ming Xu

TL;DR
This paper investigates the embedded connectivity and edge-connectivity of recursive networks like hypercubes, star graphs, and bubble-sort networks, providing exact values for these measures to understand their fault tolerance.
Contribution
It determines the h-embedded and edge-connectivity for hypercubes and star graphs, and the edge-connectivity for bubble-sort networks, advancing the understanding of network robustness.
Findings
Calculated $ ext{zeta}_h$ and $ ext{eta}_h$ for hypercubes and star graphs.
Established $ ext{eta}_3$ for bubble-sort networks.
Enhanced understanding of fault tolerance in recursive networks.
Abstract
Let be an -dimensional recursive network. The -embedded connectivity (resp. edge-connectivity ) of is the minimum number of vertices (resp. edges) whose removal results in disconnected and each vertex is contained in an -dimensional subnetwork . This paper determines and for the hypercube and the star graph , and for the bubble-sort network .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Distributed systems and fault tolerance · Parallel Computing and Optimization Techniques
