Before revision:  The disk graph G_D for D is the undirected graph with vertex set D in which two disks are joined by an edge if and only if they intersect.
After revision:  The disk graph G_D for D is the undirected graph with vertex set D in which two disks are joined by an edge if and only if they intersect.