Reliability evaluation of folded hypercubes in terms of component connectivity

2018/03/04 by Shu-Li Zhao, Weihua Yang, Zhao, Shuli +1
Computer Science · Engineering · #Combinatorics (math.CO) #Embedded Systems Design Techniques #FOS: Mathematics #Interconnection Networks and Systems #VLSI and FPGA Design Techniques

paper · pdf · doi:10.48550/arxiv.1803.01311

openalex publication_date 2018/03/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks. The g-component connectivity cκ_g(G) of a non-complete connected graph G is the minimum number of vertices whose deletion results in a graph with at least g components. The results in [Component connectivity of the hypercubes, International Journal of Computer Mathematics 89 (2012) 137-145] by Hsu et al. determines the component connectivity of the hypercubes. As an invariant of the hypercube, we determine the (g+1)-component connectivity of the folded hypercube cκ_g(FQ_n)=g(n+1)-(1)/(2)g(g+1)+1 for 1≤ g ≤ n+1, n≥ 8 in this paper.

Related

• Component edge connectivity of the folded hypercube
• Component Edge Connectivity of Hypercube-like Networks
• The generalized 3-connectivity of the folded hypercube FQ_n
• Relationship Between Component Connectivity And Component Diagnosability Of Some Regular Networks
• A concentration phenomenon for h-extra edge-connectivity reliability analysis of enhanced hypercubes Q_n,2 with exponentially many faulty links