The crossing number of C(mk;{1, k})

Graphs and Combinatorics

Volumn 21, Issue 1, 2005, Pages 89-96

  Lin, Xiaohui ^a   Yang, Yuansheng ^a   Lü, Jianguo ^a   Hao, Xin ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Circulant graph; Crossing number; Generalized Petersen graph

Indexed keywords

EID: 17144431921     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-004-0597-5     Document Type: Article

References (9)

1. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300-343 (1984)
2. Cimikowski, R.: Topological properties of some interconnection network graphs. Proc. 27th. Southeastern Intl. Conf. Comb. Graph Theory and Computing (Baton Rouge, LA, 1996). Congr. Numerantium 121, 19-32 (1996)
3. Cimikowski, R.: Crossing number bounds for the mesh of trees. Proc. 29th. Southeastern Intl. Conf. Comb., Graph Theory Comput. (Boca Raton, FL, 1998). Congr. Numerantium 134, 107-116 (1998)
4. Fiorini, S.: On the crossing number of generalized Petersen graphs. Ann. Discrete Math. 30, 221-242 (1986)
5. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4, 312-316 (1983)
6. Salazar, G.: On the crossing numbers of loop networks and generalized Petersen graphs.(to appear)
7. Lin, X., Yang, Y., Lü, J., Hao, X.: The crossing number of C(n;{1, [n/2] - 1}). Util. Math, (to appear)
8. n(1, k). National symposium on software technology held by Chinese Computer Institute 2001, pp. 134-136 (2001)
9. Yang, Y., Lin, X., Lü, J., Hao, X.: The crossing number of C(n; {1, 3}). Discrete Math. (to appear)