AbstractThe n-dimensional twisted cube, denoted by TQn, a variation of the hypercube, possesses some properties superior to the hypercube. In this paper, assuming that each vertex is incident with at least two fault-free links, we show that TQn can tolerate up to 2n−5 edge faults, while retaining a fault-free Hamiltonian cycle. The result is optimal with respect to the number of edge faults tolerated
AbstractThe crossed cube CQn is an important variant of the hypercube Qn and possesses many desirabl...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...
AbstractThe n-dimensional twisted cube, denoted by TQn, a variation of the hypercube, possesses some...
AbstractAn n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of ...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...
AbstractTwisted hypercube-like networks (THLNs) are a large class of network topologies, which subsu...
AbstractThe n-dimensional hypercube network Qn is one of the most popular interconnection networks s...
It has been known that an n-dimensional hypercube (n-cube for short) can always embed a Hamiltonian ...
[[abstract]]The crossed cube CQn is an important variant of the hypercube Qn and possesses many desi...
The interconnection network considered in this paper is the k-ary n-cube that is an attractive varia...
The crossed cube is a prominent variant of the well known, highly regular-structured hypercube. In [...
[[abstract]]Hsieh and Yu (2007) first claimed that an injured n-dimensional hypercube Q n contains (...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
AbstractThe conditional fault model imposes a constraint on the fault distribution. For example, the...
AbstractThe crossed cube CQn is an important variant of the hypercube Qn and possesses many desirabl...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...
AbstractThe n-dimensional twisted cube, denoted by TQn, a variation of the hypercube, possesses some...
AbstractAn n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of ...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...
AbstractTwisted hypercube-like networks (THLNs) are a large class of network topologies, which subsu...
AbstractThe n-dimensional hypercube network Qn is one of the most popular interconnection networks s...
It has been known that an n-dimensional hypercube (n-cube for short) can always embed a Hamiltonian ...
[[abstract]]The crossed cube CQn is an important variant of the hypercube Qn and possesses many desi...
The interconnection network considered in this paper is the k-ary n-cube that is an attractive varia...
The crossed cube is a prominent variant of the well known, highly regular-structured hypercube. In [...
[[abstract]]Hsieh and Yu (2007) first claimed that an injured n-dimensional hypercube Q n contains (...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
AbstractThe conditional fault model imposes a constraint on the fault distribution. For example, the...
AbstractThe crossed cube CQn is an important variant of the hypercube Qn and possesses many desirabl...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...