AbstractThis work investigates important properties related to cycles of embedding into the folded hypercube FQn for n≥2. The authors observe that FQn is bipartite if and only if n is odd, and show that the minimum length of odd cycles is n+1 if n is even. The authors further show that every edge of FQn lies on a cycle of every even length from 4 to 2n; if n is even, every edge of FQn also lies on a cycle of every odd length from n+1 to 2n−1
We consider edge decompositions of the n-dimensional hypercube Q$_{n}$ into isomorphic copies of a g...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
AbstractAssume that m,n and s are integers with m≥2,n≥4,0≤s<n and s is of the same parity of m. The ...
AbstractThis work investigates important properties related to cycles of embedding into the folded h...
Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube F...
AbstractA bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even len...
AbstractThe interconnection network considered in this paper is the folded hypercube that is an attr...
AbstractIn this paper, we focus on a hypercube-like structure, the folded hypercube, which is basica...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractIn this paper we study the existence of cycles of all lengths in the cube-connected cycles g...
AbstractIn this paper, we analyze a hypercube-like structure, called the folded hypercube, which is ...
AbstractAn n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of ...
Abstract: A graph G is said to be pancyclic if it contains cycles of all lengths from 4 to |V (G) | ...
AbstractIt is shown that the size of any C4k+2-free subgraph of the hypercube Qn, k⩾3, is o(e(Qn))
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...
We consider edge decompositions of the n-dimensional hypercube Q$_{n}$ into isomorphic copies of a g...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
AbstractAssume that m,n and s are integers with m≥2,n≥4,0≤s<n and s is of the same parity of m. The ...
AbstractThis work investigates important properties related to cycles of embedding into the folded h...
Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube F...
AbstractA bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even len...
AbstractThe interconnection network considered in this paper is the folded hypercube that is an attr...
AbstractIn this paper, we focus on a hypercube-like structure, the folded hypercube, which is basica...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
AbstractIn this paper we study the existence of cycles of all lengths in the cube-connected cycles g...
AbstractIn this paper, we analyze a hypercube-like structure, called the folded hypercube, which is ...
AbstractAn n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of ...
Abstract: A graph G is said to be pancyclic if it contains cycles of all lengths from 4 to |V (G) | ...
AbstractIt is shown that the size of any C4k+2-free subgraph of the hypercube Qn, k⩾3, is o(e(Qn))
AbstractThe n-dimensional hypercube Qn is a graph having 2n vertices labeled from 0 to 2n−1. Two ver...
We consider edge decompositions of the n-dimensional hypercube Q$_{n}$ into isomorphic copies of a g...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
AbstractAssume that m,n and s are integers with m≥2,n≥4,0≤s<n and s is of the same parity of m. The ...