Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference21 articles.
1. On the crossing numbers of Cartesian products of wheels and trees
2. The crossing number of C
7 × C
7;Anderson;Congr. Numer.,1996
3. The crossing number of c4 × c4
4. On the crossing numbers of S
m
× P
n
and S
m
× C
n;Jendrol;Casopis pro Pestováni Mat.,1982
5. On the crossing number of K
m
◻C
n
and K
m, l
◻P
n;Zheng;Discrete Appl. Math.,2008