December 20, 2012
This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in a hypercube-like graph $G_n$ which contain several well-known interconnection networks such as hypercubes, varietal hypercubes, twisted cubes, crossed cubes and M\"obius cubes, and proves $\lambda_s^{(h)}(G_n)= 2^h(n-h)$ for any $h$ with $0\leqslant h\leqslant n-1$ by the induction on $n$ and a new technique. This result shows that at least $2^h(n-h)$ edges of $G_n$ have to be removed to get a disconnected graph that contains no vertices of degree less than $h$. Compared with previous results, this result enhances fault-tolerant ability of the above-mentioned networks theoretically.
Similar papers 1
November 16, 2012
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 considers a kind of generalized measures $\kappa^{(h)}$ and $\lambda^{(h)}$ of fault tolerance in $EH(s,t)$ with $1\leqslant s\leqslant t$ and determines $\kappa^{(h)}(EH(s,t))=\lambda^{(h)}(EH(s,t))= 2^h(s+1-h)$ for any $h$ with $0\leqslant...
September 6, 2017
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 $\kappa^h(HCN_n)=\lambda^h(HCN_n)=2^h(n+1-h)$ for any $h$ with $0\leq h\leq n-1$. The results imply that at least $2^h(n+1-h)$ vertices or edges have to be removed from $HCN_n$ to make it disconnected with no vertices of degree less than $...
September 25, 2022
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 paths, then $G$ is strong Menger edge connected (SM-$\lambda$ for short). The conditional edge-fault-tolerance about the SM-$ \lambda$ property of $G$, written $sm_\lambda^r(G)$, is the maximum value of $m$ such that $G-F$ is still SM-$\...
April 3, 2012
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 $\lambda_s^{(h)}(S_{n,k})=\min\{(n-h-1)(h+1), (n-k+1)(k-1)\}$, which implies that at least $\min\{(n-k+1)(k-1),(n-h-1)(h+1)\}$ edges of $S_{n,k}$ have to remove to get a disconnected graph that contains no vertices of degree less than $h$. This result shows that the $(n,k)$...
September 28, 2016
Given a connected graph $G$ and a non-negative integer $g$, the {\em $g$-extra connectivity} $\k_g(G)$ of $G$ is the minimum cardinality of a set of vertices in $G$, if it exists, whose deletion disconnects $G$ and leaves each remaining component with more than $g$ vertices. This paper focuses on the $g$-extra connectivity of hypercube-like networks (HL-networks for short) which includes numerous well-known topologies, such as hypercubes, twisted cubes, crossed cubes and M\"o...
November 23, 2011
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 locally twisted cubes. This paper deals with the fault-tolerant hamiltonian connectivity of THLNs under the large fault model. Let $G$ be an $n$-dimensional THLN and $F \subseteq V(G)\bigcup E(G)$, where $n \geq 7$ and $|F| \leq 2n - 10$. We pro...
June 12, 2019
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 subset of $V(G_n)\cup E(G_n)$ with $|F|\leq n-2$. We show that for arbitrary two different correct vertices $u$ and $v$, there is a faultless path $P_{uv}$ of every length $l$ with $2^{n-1}-1\leq l\leq 2^n-f_v-1-\alpha$, where $\alpha=0$ if vert...
April 6, 2012
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 n-k$, which implies that at least $n+h(k-2)-1$ vertices of $S_{n,k}$ have to remove to get a disconnected graph that contains no vertices of degree less than $h$. This result contains some known results such as Yang et al. [Information Process...
April 26, 2024
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 1991. As an extension of traditional edge-connectivity, h-extra edge-connectivity of a connected graph G, \lambda_h(G), is an essential parameter for evaluating the reliability of interconnection networks. This article intends to study the h-extra ed...
March 24, 2022
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 edge-connectivity. With the help of edge isoperimetric problem's method in combinatorics, this paper mainly offers a novel and unified view to investigate the $\mathcal{P}$-conditional edge-connectivities of hamming graph $K_{L}^{n}$ with satisfying the pr...