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

Michael Haythorpe; Alex Newcombe

doi:10.1017/S0004972719000091

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

Michael Haythorpe, Alex Newcombe

College of Science and Engineering

Research output: Contribution to journal › Article › peer-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 S_n, and the star graph, denoted K_1,m, is considered for the first time. It is proved that the crossing number of S_nK_1,2 is n, and the crossing number of S_nK_1,3 is 3n. An upper bound for the crossing number of S_nK_1,m is also given.

Original language	English
Pages (from-to)	5-12
Number of pages	8
Journal	Bulletin of the Australian Mathematical Society
Volume	100
Issue number	1
DOIs	https://doi.org/10.1017/S0004972719000091
Publication status	Published - Aug 2019

Keywords

cartesian
sunlet graph
star graph
crossing number
cartesian product
star

Access to Document

10.1017/S0004972719000091Licence: In Copyright

Cite this

@article{03ef743fd13042b690e372180746e2c2,

title = "On the crossing number of the Cartesian product of a sunlet graph and a star graph",

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

keywords = "cartesian, sunlet graph, star graph, crossing number, cartesian product, star",

author = "Michael Haythorpe and Alex Newcombe",

year = "2019",

month = aug,

doi = "10.1017/S0004972719000091",

language = "English",

volume = "100",

pages = "5--12",

journal = "Bulletin of the Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

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

AU - Haythorpe, Michael

AU - Newcombe, Alex

PY - 2019/8

Y1 - 2019/8

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

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

KW - cartesian

KW - sunlet graph

KW - star graph

KW - crossing number

KW - cartesian product

KW - star

UR - http://www.scopus.com/inward/record.url?scp=85061225778&partnerID=8YFLogxK

U2 - 10.1017/S0004972719000091

DO - 10.1017/S0004972719000091

M3 - Article

SN - 0004-9727

VL - 100

SP - 5

EP - 12

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this