On the crossing number of the Cartesian product of a sunlet graph and a star graph

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 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.

Original languageEnglish
Pages (from-to)5-12
Number of pages8
JournalBulletin of the Australian Mathematical Society
Volume100
Issue number1
DOIs
Publication statusPublished - Aug 2019

Keywords

  • cartesian
  • sunlet graph
  • star graph
  • crossing number

Fingerprint Dive into the research topics of 'On the crossing number of the Cartesian product of a sunlet graph and a star graph'. Together they form a unique fingerprint.

Cite this