The antibandwidth problem is to label vertices of a graph G = (V, E) bijectively by 1, 2, 3, ..., | V | such that the minimal difference of labels of adjacent vertices is maximised. In this paper we discuss the antibandwidth of three-dimensional meshes. Provided results are extensions of the two-dimensional case and an analog of the result for the bandwidth of three-dimensional meshes obtained by FitzGerald. © 2007 Elsevier B.V. All rights reserved.
Török, Ľ., & Vrt’o, I. (2007). Antibandwidth of Three-Dimensional Meshes. Electronic Notes in Discrete Mathematics, 28, 161–167. https://doi.org/10.1016/j.endm.2007.01.023