Integer distance graph

Integer distance graph --- граф целочисленных расстояний.

An integer distance graph is a graph [math]\displaystyle{ G(D) }[/math] with the set of all integers as a vertex set and two vertices [math]\displaystyle{ u,v \in Z }[/math] are adjacent if and only if [math]\displaystyle{ |u - v| \in D }[/math], where the distance set [math]\displaystyle{ D }[/math] is a subset of positive integers set.