Antibandwidth of three-dimensional meshes

DOI10.1016/j.disc.2009.03.029zbMath1216.05136OpenAlexW2165549087MaRDI QIDQ960961

Imrich Vrt'o, L'ubomír Török

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.029

zbMATH Keywords

antibandwidththree-dimensional mesh

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ Bandwidth of the product of paths of the same length ⋮ A note on maximum differential coloring of planar graphs ⋮ Bandwidth and pathwidth of three-dimensional grids ⋮ Level-based heuristics and hill climbing for the antibandwidth maximization problem ⋮ Antibandwidth and Cyclic Antibandwidth of Hamming Graphs

Cites Work

• Compressions and isoperimetric inequalities
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Hamiltonian powers in threshold and arborescent comparability graphs
• Matchings and paths in the cube
• On Some Variants of the Bandwidth Minimization Problem
• Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
• On the separation number of a graph
• Optimal Indexing of the Vertices of Graphs
• Powers of Hamiltonian paths in interval graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Antibandwidth of three-dimensional meshes