Bondy J A,Murty U S R.Graph theory with application[M].Macmillan,London,1976.

Chung F R K,Leighton F T,Rosenberg A L.Embedding graph in books:a layout problem with applications to VLSI design[J].SIAM JAlgebraic Discrete Meth,1987,8:33-58.

Enomoto H,Nakamigawa T,Ota K.On the pagenumber of complete bipartite graphs[J].J Combin Theory Ser B,1997,71:111-120.

Fang J F,Lai KC.Embedding the incomplete hypercube in books[J].Information Processing Letters,2005,96:1-6.

Godsil C,Royle G.Algebraic graph theory[M].Springer,48-49.

Hwang F K.A complementary surveyon double-loop networks[J].Theoretical Computer Science,2001,263:211-229.

Kapoor N,Russell M,Stojmenovic I,et al.A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks[J].Journal ofParallel and Distributed Computing,2002,62:267-283.

Shahrokhi F,Shi W.On crossing sets,disjiont sets,and pagenumber[J].Journal of Algorithms,2000,34:40-53.,4.1

Swaminathan R,Giraraj D,Bhatia D K.The pagenumber of the class of bandwidth-k graphs is k?1[J].Inform Process Lett,1995,55:71-74.

Wood D R.Degree constrained book embeddings[J].Journal of Algorithms,2002,45:144-154.

Yang W H,Meng J X.Embedding connected double-loop networks with even cardinality in books[J].Applied Mathematics Letters,2009,22:1458-1461.