Antibandwidth of Three-Dimensional Meshes

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free