Skip to main content
Log in

On the Crossing Numbers of Products of Stars and Graphs of Order Five

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 There are several known exact results on the crossing numbers of Cartesian products of paths or cycles with “small” graphs. In this paper we extend these results to the Cartesian products of two specific 5-vertex graphs with the star K 1, n . In addition, we give the crossing number of the graph obtained by adding two edges to the graph K 1,4, n in such a way that these new edges join a vertex of degree n+1 of the graph K 1,4, n with two its vertices of the same degree.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 8, 1997 Final version received: August 14, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klešč, M. On the Crossing Numbers of Products of Stars and Graphs of Order Five. Graphs Comb 17, 289–294 (2001). https://doi.org/10.1007/s003730170042

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170042

Keywords