Graphs whose distance matrix has at most three negative eigenvalues

Let D(G) be the distance matrix of a connected simple graph G. The negative inertia of D(G), denoted by nD(G), is the number of negative eigenvalues of D(G). In this paper, we determine all connected graphs G whose distance matrix D(G) has at most three negative eigenvalues.