Let the vertices of a graph G be numbered with distinct integers 1 to left bracketing bar G right bracketing bar . Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent vertices. Equivalently, it is the maximum value of left bracketing bar i - j right bracketing bar over all nonzero elements of the adjacency matrix (a_(i j)).