M. Aouchiche and P. Hansen, Distance spectra of graphs: A survey, Lin. Algebra Appl., 458 (2014) 301–386.
 K. Balasubramanian, Computer generation of distance polynomials of graphs, Journal of Computational Chemistry,
11 (1990) 829–836.
 K. Balińska, D. Cvetković, M. Lepović and S. Simić, There are exactly 150 connected integral graphs up to 10
vertices, Univ. Beograd, Publ. Elektrotehn. Fak., Ser. Mat., 10 (1999) 95–105.
 D. Cvetković, M. Doob and H. Sachs, Spectra of Graphs–Theory and Application, third ed., Johann Ambrosius
Barth Verlag, 1995.
 H. Deng, S. Balachandran, S. K. Ayyaswamy and Y. B. Venkatakrishnan, On the average eccentricity, the harmonic
index and the largest signless Laplacian eigenvalue of a graph, 6 (2017) 43–50.
 R. L. Graham and L. Lovasz, Distance matrix polynomials of trees, Adv. Math., 29 (1978) 60–88.
 R. L. Graham and H. O. Pollak, On the addressing problem for loop switching, Bell System Tech. J., 50 (1971)
 A. Heydari, On the spectra of reduced distance matrix of dendrimers, 2 (2013) 41–46.
 G. Indulal and R. Balakrishnan, Distance spectrum of Indu-Bala product of graphs, AKCE International Journal
of Graphs and Combinatorics, (2016) 230–234.
 G. Indulal, I. Gutman and A. Vijayakumar, On distance energy of graphs, MATCH Commun. Math. Comput.
Chem., 60 (2008) 461–472.
 D. Stevanović a G. Indulal, The distance spectrum and energy of the compositions of regular graphs, Appl. Math.
Lett., 22 (2009) 1136–1140.
 Z. Stanić, There are exactly 172 connected Q-integral graphs up to 10 vertices, Novi. Sad. J. Math., 37 (2001)