Lexical tree and linear orderings for the middle-levels graphs

Details Lexical tree and linear orderings for the middle-levels graphs Lexical tree and linear orderings for the middle-levels graphs

2010-12-05

arxiv.org/abs/1012.0995v9

Mathematics

Combinatorics

13 pages, 9 figures, 15 tables

Scientific paper

Let $m=2k+1\in\Z$ be odd. The $m$-cube graph $H_m$ is the Hasse diagram of the Boolean lattice on the coordinate set $\Z_m$. A rooted binary tree $T$ is introduced that has as its nodes the translation classes mod $m$ of the weight-$k$ vertices of all $H_m$, for $0

Affiliated with

Also associated with

No associations

Rating

Lexical tree and linear orderings for the middle-levels graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lexical tree and linear orderings for the middle-levels graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lexical tree and linear orderings for the middle-levels graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-517560