The exact crossing number is only known for a small number of families of graphs. Many of the families for which crossing numbers have been determined correspond to cartesian products of two graphs. Here, the cartesian product of the sunlet graph, denoted Sn, and the star graph, denoted K1,m, is considered for the first time. It is proved that the crossing number of SnK1,2 is n, and the crossing number of SnK1,3 is 3n. An upper bound for the crossing number of SnK1,m is also given.
|Number of pages||8|
|Journal||Bulletin of the Australian Mathematical Society|
|Publication status||Published - Aug 2019|
- sunlet graph
- star graph
- crossing number
- cartesian product