On the crossing number of a torus network

抄録

Reducing the number of link crossings in a network drawn on the plane such as a wiring board is a well-known problem, and especially the calculation of the minimum number of such crossings: this is the crossing number problem. It has been shown that finding a general solution to the crossing number problem is NP-hard. So, this problem is addressed for particular classes of graphs and this is also our approach in this paper. More precisely, we focus hereinafter on the torus topology. First, we discuss an upper bound on cr (T (2, k)) the number of crossings in a 2-dimensional k-ary torus T (2, k) where k ≥ 2: the result cr (T (2, k)) ≤ k (k - 2) and the given constructive proof lay foundations for the rest of the paper. Second, we extend this discussion to derive an upper bound on the crossing number of a 3-dimensional k-ary torus: cr (T (3, k)) ≤ 2k⁴ - k³ - 4k² - 2⌈k/2 ⌉ ⌊k/2⌋ (k - (k mod 2)) is obtained. Third, an upper bound on the crossing number of an n-dimensional k-ary torus is derived from the previously established results, with the order of this upper bound additionally established for more clarity: cr (T (n, k)) is O (n²k^2n-2) when n ≥ k and O(nk^2n-1) otherwise.