Antibandwidth and cyclic antibandwidth of Hamming graphs

The antibandwidth problem is to label vertices of a 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 maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bound...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2013-07, Vol.161 (10-11), p.1402-1408
Main Authors: Dobrev, Stefan, Královič, Rastislav, Pardubská, Dana, Török, L’ubomír, Vrt’o, Imrich
Format: Article
Language:English
Subjects:
Algorithms
Antibandwidth
Graphs
Hamming graph
Integers
Labels
Marking
Mathematical analysis
Reproduction
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The antibandwidth problem is to label vertices of a 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 maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1dKnk. We have exact values for special choices of ni′s and equality between antibandwidth and cyclic antibandwidth values. Moreover, in the case where the two largest sizes of ni′s are different we show that the Hamming graph is multiplicative in the sense of [9]. As a consequence, we obtain exact values for the antibandwidth of p isolated copies of this type of Hamming graphs.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2012.12.026