论文信息 - Antibandwidth and Cyclic Antibandwidth of Hamming Graphs

Antibandwidth and Cyclic Antibandwidth of Hamming Graphs

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.

Imrich Vrto | Stefan Dobrev | Dana Pardubská | Rastislav Kralovic | L'ubomír Török

[1] JOSEP DÍAZ,et al. A survey of graph layout problems , 2002, CSUR.

[2] Oliver Vornberger,et al. On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..

[3] Garth Isaak. Powers of Hamiltonian paths in interval graphs , 1998 .

[4] Annalisa Massini,et al. Antibandwidth of Complete k-Ary Trees , 2006, Electron. Notes Discret. Math..

[5] Zevi Miller,et al. Separation numbers of trees , 2009, Theor. Comput. Sci..

[6] Garth Isaak,et al. Hamiltonian powers in threshold and arborescent comparability graphs , 1999, Discret. Math..

[7] André Raspaud,et al. Antibandwidth and cyclic antibandwidth of meshes and hypercubes , 2009, Discret. Math..

[8] Sorina Dumitrescu,et al. On explicit formulas for bandwidth and antibandwidth of hypercubes , 2009, Discret. Appl. Math..

[9] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[10] Dan Pritikin,et al. On the separation number of a graph , 1989, Networks.