Title of article
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
Author/Authors
Dobrev، نويسنده , , Stefan and Kr?lovi?، نويسنده , , Rastislav and Pardubsk?، نويسنده , , Dana and T?r?k، نويسنده , , Lʹubom?r and Vrtʹo، نويسنده , , Imrich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
6
From page
295
To page
300
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 ∏ k = 1 d K n k . We have exact values for special choices of n i ʹs and equality between antibandwidth and cyclic antibandwidth values.
Keywords
antibandwidth , Hamming graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455135
Link To Document