Dispersed graph labellings

Abstract

A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1,\dots ,n$ such that $d(i,i+1)\ge k$ for $1\le i\le n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a $k$-dispersed labelling. In this paper, we study upper and lower bounds on $DL(G)$. Computing $DL(G)$ is NP-hard. However, we determine the exact values of $DL(G)$ for cycles, paths, grids, hypercubes and complete binary trees. We also give a product construction and we prove a degree-based bound.

To be published in Australasian Journal of Combinatorics