Title of article
Antibandwidth of three-dimensional meshes
Author/Authors
T?r?k، نويسنده , , L’ubom?r and Vrt’o، نويسنده , , Imrich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
505
To page
510
Abstract
The antibandwidth problem is to label vertices of a graph G = ( V , E ) bijectively by 0 , 1 , 2 , … , | V | − 1 so that the minimal difference of labels of adjacent vertices is maximised. In this paper we prove an almost exact result for the antibandwidth of three-dimensional meshes. Provided results are extensions of the two-dimensional case and an analogue of the result for the bandwidth of three-dimensional meshes obtained by FitzGerald.
Keywords
antibandwidth , Three-dimensional mesh
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599263
Link To Document