阶为奇且连通的双环网络的书式嵌入(英文)Embedding Connected Double-loop Networks with Odd Cardinality in Books
赵斌,孟吉翔
摘要(Abstract)：
嵌入阶为奇的双环网络.图G的书式嵌入包括把G的顶点放置到书脊上并且分配图!G的到书页上且保证每个书页上无相交的边.
关键词(KeyWords)： 书式嵌入;书页数;双环网络
基金项目(Foundation): supported by NSFC(No.10671165)
作者(Author): 赵斌,孟吉翔
参考文献(References)：
- [1]Bondy J A,Murty U S R.Graph theory with application[M].Macmillan,London,1976.
- [2]Bilski T.Optimum embedding of complete graphs in books.Discrete Math,1998,182:21-28.
- [3]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.
- [4]Enomoto H,Nakamigawa T,Ota K.On the pagenumber of complete bipartite graphs[J].J Combin Theory Ser B,1997,71:111-120.
- [5]Fang J F,Lai KC.Embedding the incomplete hypercube in books[J].Information Processing Letters,2005,96:1-6.
- [6]Godsil C,Royle G.Algebraic graph theory[M].Springer,48-49.
- [7]Hwang F K.A complementary surveyon double-loop networks[J].Theoretical Computer Science,2001,263:211-229.
- [8]Hasunuma T.The pagenumber of de Bruijn and Kautz digraphs.Austral Comput Sci Comm.1999,21:232-246.
- [9]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.
- [10]Shahrokhi F,Shi W.On crossing sets,disjiont sets,and pagenumber[J].Journal of Algorithms,2000,34:40-53.,4.1
- [11]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.
- [12]Wood D R.Degree constrained book embeddings[J].Journal of Algorithms,2002,45:144-154.
- [13]Yang W H,Meng J X.Embedding connected double-loop networks with even cardinality in books[J].Applied Mathematics Letters,2009,22:1458-1461.