Volume 34, Issue 3
Embedding Cartesian Product of Some Graphs in Books

Commun. Math. Res., 34 (2018), pp. 253-260.

Published online: 2019-12

Preview Purchase PDF 57 2831
Export citation

Cited by

• Abstract

The book embedding of a graph $G$ consists of placing the vertices of $G$ in a line called spine and assigning edges of the graph to pages so that the edges assigned to the same page do not intersect. The number of pages is the minimum number in which the graph can be embedded. In this paper, we study the book embedding of the Cartesian product $P_m\times S_n$, $P_m\times W_n$, $C_n\times S_m$, $C_n\times W_m$, and get an upper bound of their pagenumber.

• Keywords

book embedding, cartesian product, pagenumber

• AMS Subject Headings

05C10

• Copyright

COPYRIGHT: © Global Science Press

• Email address

921246189@qq.com (Jiao Yang)

• BibTex
• RIS
• TXT
@Article{CMR-34-253, author = {Yang , Jiao and Shao , Zeling and Li , Zhiguo}, title = {Embedding Cartesian Product of Some Graphs in Books}, journal = {Communications in Mathematical Research }, year = {2019}, volume = {34}, number = {3}, pages = {253--260}, abstract = {

The book embedding of a graph $G$ consists of placing the vertices of $G$ in a line called spine and assigning edges of the graph to pages so that the edges assigned to the same page do not intersect. The number of pages is the minimum number in which the graph can be embedded. In this paper, we study the book embedding of the Cartesian product $P_m\times S_n$, $P_m\times W_n$, $C_n\times S_m$, $C_n\times W_m$, and get an upper bound of their pagenumber.

}, issn = {2707-8523}, doi = {https://doi.org/10.13447/j.1674-5647.2018.03.07}, url = {http://global-sci.org/intro/article_detail/cmr/13496.html} }
TY - JOUR T1 - Embedding Cartesian Product of Some Graphs in Books AU - Yang , Jiao AU - Shao , Zeling AU - Li , Zhiguo JO - Communications in Mathematical Research VL - 3 SP - 253 EP - 260 PY - 2019 DA - 2019/12 SN - 34 DO - http://doi.org/10.13447/j.1674-5647.2018.03.07 UR - https://global-sci.org/intro/article_detail/cmr/13496.html KW - book embedding, cartesian product, pagenumber AB -

The book embedding of a graph $G$ consists of placing the vertices of $G$ in a line called spine and assigning edges of the graph to pages so that the edges assigned to the same page do not intersect. The number of pages is the minimum number in which the graph can be embedded. In this paper, we study the book embedding of the Cartesian product $P_m\times S_n$, $P_m\times W_n$, $C_n\times S_m$, $C_n\times W_m$, and get an upper bound of their pagenumber.

Jiao Yang, Zeling Shao & Zhiguo Li. (2019). Embedding Cartesian Product of Some Graphs in Books. Communications in Mathematical Research . 34 (3). 253-260. doi:10.13447/j.1674-5647.2018.03.07
Copy to clipboard
The citation has been copied to your clipboard