相关论文: Hamiltonian laceability with a set of faulty edges…

The balanced hypercube $BH_{n}$, a variant of the hypercube, is a novel interconnection network for massive parallel systems. It is known that the balanced hypercube remains Hamiltonian after deleting at most $4n-5$ faulty edges if each…

The hypercube \( Q_n \) contains a Hamiltonian path joining \( x \) and \( y \) (where $x$ and $y$ from the opposite partite set) containing \( P \) if and only if the induced subgraph of \( P \) is a linear forest, where none of these…

We consider hypercubes with pairwise disjoint faulty edges. An $n$-dimensional hypercube $Q_n$ is an undirected graph with $2^n$ nodes, each labeled with a distinct binary strings of length $n$. The parity of the vertex is 0 if the number…

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. Zhou et al. [Inform. Sci. 300 (2015) 20-27] proposed an interesting problem that whether there is a fault-free Hamiltonian cycle in $BH_n$ with each vertex incident to at…

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.…

Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with $2n-4$ faulty edges, Information Sciences, 215 (2012) 75--82] observed that the hypercube $Q_n$ is not Hamiltonian if it contains a trap disconnected halfway. A proper…

Aims: Try to prove the $n$-dimensional balanced hypercube $BH_n$ is $(2n-2)$-fault-tolerant-prescribed hamiltonian laceability. Methods: Prove it by induction on $n$. It is known that the assertation holds for $n\in\{1,2\}$. Assume it holds…

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…

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 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.…

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…

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…

This paper considers the problem of many-to-many disjoint paths in the hypercube $Q_n$ with $f$ faulty vertices and obtains the following result. For any integer $k$ with $1\leq k\leq n-2$, any two sets $S$ and $T$ of $k$ fault-free…

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…

As a variant of the well-known hypercube, the balanced hypercube $BH_n$ was proposed as a novel interconnection network topology for parallel computing. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2\}$ and $T=\{t_1,t_2\}$…

We investigate the combined occurrence of edge faults and vertex faults in the burnt pancake graph (\( BP_n \)). In this paper, we prove that \( BP_n - F \), where \( F \) includes pairs of end-vertices of matching edges and fault-tolerant…

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…

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…

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,…

We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for…