The ℓ-component connectivity of a graph G, denoted by c κ ℓ (G), is the minimum number of
vertices whose removal from G results in a disconnected graph with at least ℓ components or …

Reliability evaluation of interconnection networks is of significant importance to the design
and maintenance of interconnection networks. The extra edge-connectivity and component …

Reliability evaluation of multiprocessor systems is of great significance to the design and
maintenance of these systems. As two generalizations of traditional edge connectivity, extra …

Enhancing the invulnerability of multiprocessor systems against malicious attacks has been
regarded as one of the important issues in network science and big data era. Thus, in order …

Reliability of interconnection networks is important to design multiprocessor systems. The
extra edge connectivity and component edge connectivity are two parameters for the …

We define a new class of graphs by generalizing the hypercube-like networks to folded
hypercube-like networks FH n. We also investigate the reliability of this class of graphs in …

For an integer, the-component connectivity (resp.-component edge connectivity) of a graph,
denoted by (resp.), is the minimum number of vertices (resp. edges) whose removal from …

Reliability measure of multiprocessor systems is of significant importance to the design and
maintenance of multiprocessor systems. Based on edge connectivity, more refined …

Hypercube and folded hypercube are the most fundamental interconnection networks for the
attractive topological properties. We assume for any distinct vertices u, v∈ V, κ (u, v) defined …

The L-ary n-dimensional hamming graph KL n is one of the most attractive interconnection
networks for parallel processing and computing systems. Analysis of the link fault tolerance …