Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
From MaRDI portal
Publication:2851478
DOI10.1016/j.endm.2009.07.048zbMath1273.05190MaRDI QIDQ2851478
Imrich Vrt'o, Stefan Dobrev, Rastislav Královič, L'ubomír Török, Dana Pardubská
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.048
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Tabu search for the cyclic bandwidth problem, A special antidilation problem for meshes and Hamming graphs, Memetic algorithm for the antibandwidth maximization problem, GRASP with path relinking heuristics for the antibandwidth problem
Cites Work
- Unnamed Item
- Separation numbers of trees
- Antibandwidth of three-dimensional meshes
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Hamiltonian powers in threshold and arborescent comparability graphs
- On Some Variants of the Bandwidth Minimization Problem
- Antibandwidth of Complete k-Ary Trees
- On the separation number of a graph