The inertia of distance matrices of some graphs

Let DD denote the distance matrix of a connected graph GG. The inertia of DD is the triple of integers (n+(D),n0(D),n−(D))(n+(D),n0(D),n−(D)), where n+(D)n+(D), n0(D)n0(D), n−(D)n−(D) denote the number of positive, 0, and negative eigenvalues of DD, respectively. In this paper, we mainly give some graphs whose n+(D)n+(D) is equal to 11 and get the inertia of their distance matrices.