AbstractIn this paper, we focus on a hypercube-like structure, the folded hypercube, which is basically a standard hypercube with some extra links between its nodes. Let f be a faulty vertex in an n-dimensional folded hypercube FQn. We show that FQn−{f} contains a fault-free cycle of every even length from 4 to 2n−2 if n≥3 and, furthermore, every odd length from n+1 to 2n−1 if n≥2 and n is even
AbstractThe crossed cube CQn is an important variant of the hypercube Qn and possesses many desirabl...
AbstractIn this paper, we analyze a hypercube-like structure, called the folded hypercube, which is ...
AbstractThe problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional h...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
AbstractThis work investigates important properties related to cycles of embedding into the folded h...
AbstractAn n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of ...
It has been known that an n-dimensional hypercube (n-cube for short) can always embed a Hamiltonian ...
Let F be a faulty set in an n-dimensional hypercube Q(n) such that in Q(n) - F each vertex is incide...
In this paper, we consider the problem embedding a cycle into the hypercube Qn with existence of fau...
Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube F...
AbstractThe n-dimensional twisted cube, denoted by TQn, a variation of the hypercube, possesses some...
The interconnection network considered in this paper is the k-ary n-cube that is an attractive varia...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
AbstractThe crossed cube CQn is an important variant of the hypercube Qn and possesses many desirabl...
AbstractIn this paper, we analyze a hypercube-like structure, called the folded hypercube, which is ...
AbstractThe problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional h...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
AbstractThis work investigates important properties related to cycles of embedding into the folded h...
AbstractAn n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of ...
It has been known that an n-dimensional hypercube (n-cube for short) can always embed a Hamiltonian ...
Let F be a faulty set in an n-dimensional hypercube Q(n) such that in Q(n) - F each vertex is incide...
In this paper, we consider the problem embedding a cycle into the hypercube Qn with existence of fau...
Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube F...
AbstractThe n-dimensional twisted cube, denoted by TQn, a variation of the hypercube, possesses some...
The interconnection network considered in this paper is the k-ary n-cube that is an attractive varia...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
AbstractThe crossed cube CQn is an important variant of the hypercube Qn and possesses many desirabl...
AbstractIn this paper, we analyze a hypercube-like structure, called the folded hypercube, which is ...
AbstractThe problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional h...