Crossing number of Cartesian product of prism and path
An m-prism is the Cartesian product of an m-cycle and a path with 2 vertices. We prove that the crossing number of the join of an m-prism () and a graph with k isolated vertices is km for each We then use this result to prove that the crossing number of the Cartesian product of a 5-prism and a path...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-09-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.12.003 |
Summary: | An m-prism is the Cartesian product of an m-cycle and a path with 2 vertices. We prove that the crossing number of the join of an m-prism () and a graph with k isolated vertices is km for each We then use this result to prove that the crossing number of the Cartesian product of a 5-prism and a path with n vertices is This answers partially the conjecture raised by Peng and Yiew (in 2006) in the affirmative. |
---|---|
ISSN: | 0972-8600 2543-3474 |