2000 character limit reached
Cycles in enhanced hypercubes
Published 16 Sep 2015 in cs.DM and math.CO | (1509.04932v1)
Abstract: The enhanced hypercube $Q_{n,k}$ is a variant of the hypercube $Q_n$. We investigate all the lengths of cycles that an edge of the enhanced hypercube lies on. It is proved that every edge of $Q_{n,k}$ lies on a cycle of every even length from $4$ to $2n$; if $k$ is even, every edge of $Q_{n,k}$ also lies on a cycle of every odd length from $k+3$ to $2n-1$, and some special edges lie on a shortest odd cycle of length $k+1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.