The Cyclic Antibandwidth Problem

The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle C n , such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a variant of obnoxious facility location problems or a dual problem to the cyclic bandwidth problem. The problem is NP-hard. In the paper we start investigating this invariant for typical graphs. We prove basic facts and exact results for meshes, tori and asymptotics for hypercubes.