Cycles and Paths Embedded in Varietal Hypercubes

Abstract

The varietal hypercube $V{Q}_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper shows that every edge of $V{Q}_n$ is contained in cycles of every length from 4 to $2^n$ except 5, and every pair of vertices with distance $d$ is connected by paths of every length from $d$ to $2^n-1$ except 2 and 4 if $d=1$.

Cited by in corpus (1)

• Transitivity of Varietal Hypercube Networks