Skip to main content

The Crossing Numbers of Join of Paths and Cycles with Two Graphs of Order Five

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7125)

Abstract

The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. Only few results concerning crossing numbers of graphs obtained as join product of two graphs are known. There are collected the exact values of crossing numbers for join of all graphs of at most four vertices with paths and cycles. In the paper, we extend these results. For two special graphs G on five vertices, we give the crossing numbers of the join products G + D n , G + P n , and G + C n , where D n consists on n isolated vertices, P n and C n are the path and cycle on n vertices, respectively.

Keywords

  • graph
  • drawing
  • crossing number
  • join product
  • path
  • cycle

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic and Discrete Methods 4, 312–316 (1983)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Kleitman, D.J.: The crossing number of K 5,n . J. Combin. Theory 9, 315–323 (1970)

    CrossRef  MATH  Google Scholar 

  3. Klešč, M.: The join of graphs and crossing numbers. Electronic Notes in Discrete Math. 28, 349–355 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Klešč, M.: The crossing numbers of join of the special graph on six vertices with path and cycle. Discrete Math. 310, 1475–1481 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Klešč, M., Schrötter, S.: The crossing numbers of join products of paths with graphs of order four. Discuss. Math. – Graph Theory 31, 321–331 (2011)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Kulli, V.R., Muddebihal, M.H.: Characterization of join graphs with crossing number zero. Far East J. Appl. Math. 5, 87–97 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klešč, M., Schrötter, Š. (2012). The Crossing Numbers of Join of Paths and Cycles with Two Graphs of Order Five. In: Adam, G., Buša, J., Hnatič, M. (eds) Mathematical Modeling and Computational Science. MMCP 2011. Lecture Notes in Computer Science, vol 7125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28212-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28212-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28211-9

  • Online ISBN: 978-3-642-28212-6

  • eBook Packages: Computer ScienceComputer Science (R0)