Skip to main content
Log in

The Crossing Number of C(8, 2)□P n

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

C(n, k) is a graph obtained from n-cycle \(C_n\, (v_1\cdots v_nv_1)\) by adding edges v i v i+k (i = 1, 2,...,n, i + k (mod n)). There are several known results on the crossing numbers of the Cartesian products of C(n, k) (n ≤ 7) with paths, cycles and stars. In this paper we extend these results, and show that the crossing number of the Cartesian product of C(8, 2) with P n is 8n.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, M.S.R.: Graph Theory with Application. Am. Elsevier, New York, (1976)

  2. Klešč, M.: The crossing numbers of products of paths and stars with 4-vertex graphs. J. Graph Theory 18, 605–614(1994)

    Google Scholar 

  3. Beineke, L.W., Ringeisen, R.D.: On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory 4,145–155 (1980)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Disc. Meth. 4, 312–316 (1983)

    Google Scholar 

  5. Klešč, M.: The crossing number of K 5 × P n . Tatra Mount. Math. Public. 18, 63–68 (1999)

  6. Lv, S., Huang, Y.: The crossing number of K 5 × S n . J. Math. Res. Expos., in press (2007)

  7. Liu,T., Liu, Y.: On the crossing Number of Circular Graphs. OR Transaction 24, 32–36 (1998)

    Google Scholar 

  8. Yuan, Z., Huang, Y.: The crossing number of K 2,2,2 × P n and K 1,1,2,2 × P n , submitted to Adv. math. (2007)

  9. Zhou, Z., Huang, Y.: The crossing number of K 3,3 × P n . J. Nat. Sci. Hunan Normal Univ. 30(1), 31–34 (2007)

    Google Scholar 

  10. Yuan, Z., Huang, Y.: The crossing number of C(7,2) × P n . Adv. Math. 2, 245–253 (2008)

    Google Scholar 

  11. Peng, Y.H., Yiew, Y.C.: The crossing number of P(3,1) × P n . Discrete Math. 306, 1941–1946 (2006)

    Google Scholar 

  12. Dean, A.M., Richter, R.B.: The Crossing Number of C 4 × C 4. J. Graph Theory 19, 125–29 (1995)

    Google Scholar 

  13. Yang Y., Liu X., Liu J., Hao X.: The crossing number of C(n; {1, 3}). Discrete Math. 289, 107–118 (2004)

    Google Scholar 

  14. Ma, D., Ren, H., Lu, J.: The crossing number of the circular graph C(2m + 2, m). Discrete Math. 304, 88–93 (2005)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zihan Yuan.

Additional information

Yuanqiu Huang: Research supported by NSFC (10771062) and New Century Excellent Talents in University (NCET-07-0276).

Jinwang Liu: Research supported by NSFC (10771058) and Hunan NSFC(O6jj20053).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuan, Z., Ling, T., Huang, Y. et al. The Crossing Number of C(8, 2)□P n . Graphs and Combinatorics 24, 597–604 (2008). https://doi.org/10.1007/s00373-008-0800-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-008-0800-1

Keywords

Navigation