2012/11/19 by Jinwei Cao, Xiao Li, Cao, Jin +3 · 1 citation
Computer Science · Engineering · #05C38 #90B10 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1211.4283
openalex publication_date 2012/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The varietal hypercube VQn is a variant of the hypercube Qn and has better properties than Qn with the same number of edges and vertices. This paper shows that every edge of VQn is contained in cycles of every length from 4 to 2n except 5, and every pair of vertices with distance d is connected by paths of every length from d to 2n-1 except 2 and 4 if d=1.