Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The Crossing Number of Cartesian Products of Complete Bipartite Graphs K2,m with Paths P n

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Most results on the crossing number of a graph focus on the special graphs, such as Cartesian products of small graphs with paths P n , cycles C n or stars S n . In this paper, we extend the results to Cartesian products of complete bipartite graphs K2,m with paths P n for arbitrary m ≥  2 and n ≥  1.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Bokal, D.: On the crossing number of Cartesian procuct with path. J. Combin. Theory Series B 97, 381–384 (2007)

    Google Scholar 

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

    Google Scholar 

  • Harary, F.: Graph Theory. Addison-Wesley, Reading, Mass (1969)

  • Jonathan, L., Gross, Thomas W. Tucker: Topological Graph Theory. A Wiley-Interscience Publication, John Wiley & Sons, Canada (1987)

  • Glebsky, L.Y., Salazar, G.: The crossing number of C m  ×  C n is as conjectured for n ≥  m(m + 1). J. Graph Theory 47, 53–72 (2004)

  • Klesc, M.: On the crossing numbers of Cartesian products of stars and paths or cycles. Math. Slovaca 41(2), 113–120 (1991)

    Google Scholar 

  • Klesc, M.: The crossing number of K2,3 ×  C3. Discrete Math. 251, 109–117 (2002)

    Google Scholar 

  • Klesc, M.: The crossing number of K2, 3 ×  P n and K2, 3 ×  S n . Tatra Moutains Math. Publ. 9, 51–56 (1996)

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

    Google Scholar 

  • Jendrol’, S., Scerbová, M.: On the crossing numbers of S m  ×  P n and S m  ×  C n . Čas. Pest. Mat. 107, 225–230 (1982)

  • Wang Jing, Huang Yuanqiu: The crossing number of K2,4 ×  P n . accepted in Acta Math. Sci. (in Chinese)

  • Zhou Zhiyong, Huang Yuanqiu: The crossing number of S5 ×  P n and S5 ×  C n . submitted

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Normal University of Hunan, Changsha, 410081, P.R. China

    Tang Ling

  2. Institute of Mathematics, Northern Jiaotong University, Beijing, 100044, P.R. China

    Lv Shengxiang

  3. Department of Mathematics, Normal University of Hunan, Changsha, 410081, P.R. China

    Huang Yuanqiu

Authors
  1. Tang Ling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lv Shengxiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huang Yuanqiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Tang Ling or Huang Yuanqiu.

Additional information

Supported by the NSFC (No. 10771062) and the program for New Century Excellent Talents in University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ling, T., Shengxiang, L. & Yuanqiu, H. The Crossing Number of Cartesian Products of Complete Bipartite Graphs K2,m with Paths P n . Graphs and Combinatorics 23, 659–666 (2007). https://doi.org/10.1007/s00373-007-0761-9

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-007-0761-9

Keywords

Search

Navigation