Upper and Lower bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube
SaÃ„Â±d Bettayeb, David Hoelzeman
Journal of Digital Information Management, Vol. 7, No. 1, 2009.
DOI: 
Link: http://www.dirf.org/jdim/v7n1a5.asp
Abstract:
Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.