A book embedding of a graph consists of an embedding of its vertices along the spine of a book, and an embedding of its edges on the pages such that edges embedded on the same page do not intersect. The pagenumber is the minimum number of pages in which the graph $G$ can be embedded. The main purpose of this paper is to study the book embedding of the complete expansion graph. This is the first work about it, and some exact pagenumbers of the complete expansion graphs of some special graphs are obtained.