Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
From MaRDI portal
Publication:2851478
DOI10.1016/j.endm.2009.07.048zbMath1273.05190OpenAlexW2179389847MaRDI QIDQ2851478
Rastislav Královič, Stefan Dobrev, Imrich Vrt'o, Dana Pardubská, L'ubomír Török
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
Related Items (5)
Tabu search for the cyclic bandwidth problem ⋮ The maximum \(k\)-differential coloring problem ⋮ Memetic algorithm for the antibandwidth maximization problem ⋮ A special antidilation problem for meshes and Hamming graphs ⋮ GRASP with path relinking heuristics for the antibandwidth problem
Cites Work
- 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
- Powers of Hamiltonian paths in interval graphs
This page was built for publication: Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
