The crossing number of C(n; {1, ⌊n/2⌋ - 1})

Utilitas Mathematica

Volumn 71, Issue , 2006, Pages 245-255

  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: 33845787115     PISSN: 03153681     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. S. Fiorini, On the crossing number of generalized Petersen graphs, Ann. Discrete Math. 30(1986), 221-242.
2. M. R. Garey and D. S. Johnson, Crossing Number is NP-complete, SIAM J. Alg. Disc. Meth. 4(1983), 312-316.
3. M. Lovrečič Saražin, The crossing number of the generalized Petersen graph P(10, 4) is four, Math. Slovaca, 47 (1997) 189-192.
4. S.N. Bhatt and F.T. Leighton, A framework for solving VLSI graph layout problems, J. Comput. & Systems Science, 28(1984), 300-343.
5. R. B. Richter and G. Salazar, The crossing number P(N, 3), Graphs and Combinatorics, 18(2002), No.2, 381-394.
6. G. Salazar, On the crossing numbers of loop networks and generalized Petersen graphs, to appear.
7. R. Cimikowski, Topological properties of some interconnection network graphs, Proc. of the 27th. Southeastern Intl. Conference on Combinatorics, Graph Theory and Computing(Baton Rouge, LA, 1996). Congr. Numer. 121(1996), No.2, 19-32.
8. R. Cimikowski, Crossing number bounds for the mesh of trees, Proc. of the 29th. Southeastern Intl. Conference on Combinatorics, Graph Theory and Computing(Boca Raton, FL, 1998). Congr. Numer. 134(1998), 107-116.
9. Yang Yuan-sheng, Wang Dan, Lu Wei-ming, The Crossing Number of Regular Graphs of Degree 4, Journal of Software, 2002,13(12), 2259-2266
10. n(1, k), National symposium on software technology held by Chinese Computer Institute 2001, 2001, 134-136.
11. Yang Yuansheng, Lin Xiaohui, Lü Jianguo and HaoXin, The Crossing Number of C(n; {1, 3}), Discrete Math. to appear.