Antibandwidth and Cyclic Antibandwidth of Hamming Graphs

Electronic Notes in Discrete Mathematics

Volumn 34, Issue , 2009, Pages 295-300

  Dobrev, Stefan ^a   Královič, Rastislav ^b   Pardubská, Dana ^b   Török, L'ubomír ^c   Vrt'o, Imrich ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b Physics and Informatics   (Slovakia)

^c MATEJ BEL UNIVERSITY   (Slovakia)

Author keywords

antibandwidth; Hamming graph

Indexed keywords

EID: 67651180703     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2009.07.048     Document Type: Article

References (11)

1. Calmoneri T., Massini A., Török L.'., and Vrt'o I. Antibandwidth of complete k-ary trees. Electronic Notes in Discrete Mathematics 24 (2006) 259-266
2. Donnely S., and Isaak G. Hamiltonian powers in treshold and arborescent comparability graphs. Discrete Mathematics 202 (1999) 33-44
3. Díaz J., Petit J., and Serna M. A survey of graph layout problems. ACM Computing Surveys 34 (2002) 313-356
4. Hale W.K. Frequency assignment: theory and applications. Proceedings of IEEE 60 (1980) 1497-1514
5. Isaak G. Powers of Hamiltonian paths in interval graphs. J. Graph Theory 28 (1998) 31-38
6. Leung J.Y.-T., Vornberger O., and Witthoff J.D. On some variants of the bandwidth minimization problem. SIAM J. Computing 13 (1984) 650-667
7. Miller Z., and Pritikin D. On the separation number of a graph. NETWORKS 19 (1989) 651-666
8. Raspaud A., Schröder H., Sýkora O., Török L.'., and Vrt'o I. Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics 309 (2009) 3541-3552
9. Tao Jiang, Miller, Z., Pritikin, D., Separation numbers of trees, Theoretical Computer Science, to appear
10. Török, L'., Vrt'o, I., Antibandwidth of three-dimensional meshes, Discrete Mathematics, to appear
11. Wang X., Wu X., and Dumitrescua S. On explicit formulas for bandwidth and antibandwidth of hypercubes. Discrete Applied Mathematics 8 (2009) 1947-1952