Related papers: Edge-Fault Tolerance of Hypercube-like Networks
This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\leqslant k \leqslant n-1$ and $0\leqslant h \leqslant n-k$, and determines…
The edge-fault-tolerance of networks is of great significance to the design and maintenance of networks. For any pair of vertices $u$ and $v$ of the connected graph $G$, if they are connected by $\min \{ \deg_G(u),\deg_G(v)\}$ edge-disjoint…
This paper considers the conditional fault tolerance, $h$-super connectivity $\kappa^{h}$ and $h$-super edge-connectivity $\lambda^{h}$ of the hierarchical cubic network $HCN_n$, an attractive alternative network to the hypercube, and shows…
The exchanged hypercube $EH(s,t)$, proposed by Loh {\it et al.} [The exchanged hypercube, IEEE Transactions on Parallel and Distributed Systems 16 (9) (2005) 866-874], is obtained by removing edges from a hypercube $Q_{s+t+1}$. This paper…
Fault tolerance of an $(n,k)$-star network is measured by its $h$-super connectivity $\kappa_s^{(h)}$ or $h$-super edge-connectivity $\lambda_s^{(h)}$. Li {\it et al.} [Appl. Math. Comput. 248 (2014), 525-530; Math. Sci. Lett. 1 (2012),…
We consider the probability model of edge-fault tolerance of a network in the sense of connectivity with link faults. Using graph-theoretical notation, we define the edge-fault (EF) and Menger-type edge-fault (MEF) tolerances of a graph as…
This paper considers a kind of generalized measure $\kappa_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ and determines $\kappa_s^{(h)}(S_{n,k})=n+h(k-2)-1$ for $2 \leqslant k \leqslant n-1$ and $0\leqslant h \leqslant…
As a generalization of the traditional connectivity, the g-component edge connectivity c{\lambda}g(G) of a non-complete graph G is the minimum number of edges to be deleted from the graph G such that the resulting graph has at least g…
As the scale of data centers continues to grow, there is an increasing demand for interconnection networks to resist malicious attacks. Hence, it is necessary to evaluate the reliability of networks under various fault patterns. The family…
Twisted hypercube-like networks (THLNs) are an important class of interconnection networks for parallel computing systems, which include most popular variants of the hypercubes, such as crossed cubes, M\"obius cubes, twisted cubes and…
System level diagnosis is an important approach for the fault diagnosis of multiprocessor systems. In system level diagnosis, diagnosability is an important measure of the diagnosis capability of interconnection networks. But as a measure,…
Let $F_{v}$ (resp. $F_e$) be the set of faulty vertices (resp. faulty edges) in the $n$-dimensional balanced hypercube $BH_n$. Fault-tolerant Hamiltonian laceability in $BH_n$ with at most $2n-2$ faulty edges is obtained in [Inform. Sci.…
Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The $(n, k)$-enhanced hypercube $Q_{n,k}$, as a variation of the hypercube $Q_{n}$, was proposed by Tzeng and Wei in…
The twisted hypercube-like networks($THLNs$) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of $n$-dimensional($n$-$D$) $THLNs$. Let $G_n$ be an $n$-$D$ $THLN$ and $F$ be a…
A connected graph $G$ is called strongly Menger edge connected if $G$ has min\{deg$_G(x)$, deg$_G(y)$\} edge-disjoint paths between any two distinct vertices $x$ and $y$ in $G$. In this paper, we consider two types of strongly Menger edge…
The connectivity and edge connectivity of interconnection network determine the fault tolerance of the network. An interconnection network is usually viewed as a connected graph, where vertex corresponds processor and edge corresponds link…
The augmented cube $AQ_n$, proposed by Choudum and Sunitha [S. A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], is a $(2n-1)$-regular $(2n-1)$-connected graph $(n\ge 4)$. This paper determines that the 2-extra…
Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the $h$-edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty links. This kind of diagnosability is a generalization of…
Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…
The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. R.X. Hao et al. $(2014)$ \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adjacent vertices in $BH_n$ with $(2n-2)$ faulty edges. D.Q.…