Antibandwidth and cyclic antibandwidth of Hamming graphs
From MaRDI portal
Publication:2446319
DOI10.1016/j.dam.2012.12.026zbMath1287.05133MaRDI QIDQ2446319
Imrich Vrt'o, Stefan Dobrev, Rastislav Královič, L'ubomír Török, Dana Pardubská
Publication date: 16 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.12.026
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Memetic algorithm for the antibandwidth maximization problem
- Separation numbers of trees
- On the bandwidth of 3-dimensional Hamming graphs
- Antibandwidth of three-dimensional meshes
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Antibandwidth of complete \(k\)-ary trees
- Hamiltonian powers in threshold and arborescent comparability graphs
- On an isoperimetric problem for Hamming graphs
- A dynamic survey of graph labeling
- On the bandwidth of a Hamming graph
- On Maximum Differential Graph Coloring
- On Some Variants of the Bandwidth Minimization Problem
- Antibandwidth of d-Dimensional Meshes
- On the separation number of a graph