摘要
把一个图G嵌入到书中就是把G的顶点放到书脊上,各条边嵌入到一些半平面上并且保证同一个半平面内各条边不相交.在本文中,作者讨论了路和圈字典积的书式嵌入问题,并且给出了这些图书页数的上界.特别的,在某些条件下,作者给出了这些图确定的书页数.
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 assigned to the same page without crossing. In this paper, we discuss book embedding of lexicographic product of paths and cycles, and give upper bounds of the page number of these graphs. Specially, in some conditions, we can determine the exact page number of these graphs.
出处
《新疆大学学报（自然科学版）》
CAS
北大核心
2016年第1期1-5,共5页
Journal of Xinjiang University(Natural Science Edition)
基金
Supported by the Natural Science Foundation of China(11531011,11401510,11501487)
the Key Laboratory Project of Xinjiang(2015KL019)
the Doctoral Scientific Research Fund of Xinjiang University(BS150208)
关键词
书式嵌入
书页数
字典积
book embedding
page number
lexicographic product
