English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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.

ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH