We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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 
${\mathcal{S}}_{n}$, and the star graph, denoted 
$K_{1,m}$, is considered for the first time. It is proved that the crossing number of 
${\mathcal{S}}_{n}\Box K_{1,2}$ is 
$n$, and the crossing number of 
${\mathcal{S}}_{n}\Box K_{1,3}$ is 
$3n$. An upper bound for the crossing number of 
${\mathcal{S}}_{n}\Box K_{1,m}$ is also given.
