期刊文献+

Embedding Generalized Petersen Graph in Books 被引量:3

Embedding Generalized Petersen Graph in Books
原文传递
导出
摘要 A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is the minimum number of pages in which the graph G can be embedded. In this paper, the authors discuss the embedding of the generalized Petersen graph and determine that the page number of the generalized Petersen graph is three in some situations, which is best possible. A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is the minimum number of pages in which the graph G can be embedded. In this paper, the authors discuss the embedding of the generalized Petersen graph and determine that the page number of the generalized Petersen graph is three in some situations, which is best possible.
出处 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2016年第3期385-394,共10页 数学年刊(B辑英文版)
基金 supported by the National Natural Science Foundation of China(Nos.11531010,11401510,11501487) the Key Laboratory Project of Xinjiang(No.2015KL019) the Doctoral Fund of Xinjiang University(No.BS150208)
关键词 彼得森图 广义 嵌入 最小数 面数 顶点 相交 Book embedding, Page number, Generalized Petersen graph
  • 相关文献

参考文献18

  • 1Bondy, J. A. and Murty, U. S. R., Graph Theory with Application, Macmillan, London, 1976.
  • 2Bilski, T., Optimum embedding of complete graphs in books, Discrete Math., 182, 1998, 21-28.
  • 3Chung, F. R. K., Leighton, F. T. and Rosenberg, A. L., Embedding graph in books: A layout problem with applications to VLSI design, SIAM J. Algebr. Discrete Methods, 8(1), 1987, 33-58.
  • 4Endo, T., The page number of toroidal graphs is at most seven, Discrete Math., 175, 1997, 87-96.
  • 5Nakamoto, A. and Ozeki, K., Book embedding of toroidal bipartite graphs, SIAM J. Discrete Math., 26 (2), 2012, 661-669.
  • 6Fang, J. F. and Lai, K. C., Embedding the incomplete hypercube in books, Inf. Process. Lett., 96, 2005, 1-6.
  • 7Enomoto, H., Nakamigawa, T. and Ota, K., On the page number of complete bipartite graphs, J. Comb. Theory B, 71, 1997, 111-120.
  • 8Sperfeld, K., On the page number of complete odd-partite graphs, Discrete Math., 313, 2013, 1689-1696.
  • 9Swaminathan, R., Giraraj, D. and Bhatia, D. K., The page number of the class of bandwidth-k graphs is k - 1, Inf. Process. Lett., 55, 1995, 71-74.
  • 10Yang, W. H. and Meng, J. X., Embedding connected double-loop networks with even cardinality in books, Appl. Math. Lett., 22, 2009, 1458-1461.

同被引文献5

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部