Antibandwidth of three-dimensional meshes

  • Török L
  • Vrt'o I
  • 5


    Mendeley users who have this article in their library.
  • 7


    Citations of this article.


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. © 2009 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Antibandwidth
  • Three-dimensional mesh

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • L'ubomír Török

  • Imrich Vrt'o

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free