| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652354 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
Abstract
The antibandwidth problem is to label vertices of graph G(V,E) bijectively by integers 0,1,…,|V|−1 in such a way that the minimal difference of labels of adjacent vertices is maximised. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs . We have exact values for special choices of ni's and equality between antibandwidth and cyclic antibandwidth values.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
