References
- Van Dam ER, Haemers WH. Which graphs are determined by their spectrum? Linear Algebra Appl. 2003;373:241–272.
- Van Dam ER, Haemers WH, Koolen JH. Cospectral graphs and the generalized adjacency matrix. Linear Algebra Appl. 2007;423:33–41.
- Van Dam ER, Haemers WH. Developments on spectral characterizations of graphs. Discrete Math. 2009;309:576–586.
- Lin HQ, Hong Y, Wang JF, et al. On the distance spectrum of graphs. Linear Algebra Appl. 2013;439:1662–1669.
- Jin YL, Zhang XD. Complete multipartite graphs are determined by their distance spectra. Linear Algebra Appl. 2014;448:285–291.
- Lin HQ, Zhai MQ, Gong SC. On graphs with at least three distance eigenvalues less than 1. Linear Algebra Appl. 2014;458:548–558.
- Lin HQ. On the least distance eigenvalue and its applications on the distance spread. Discrete Math. 2015;338:868–874.
- Li D, Meng JX. The graphs with the least distance eigenvalue at least 1+17 2. Linear Algebra Appl. 2016;493:358–380.
- Xing RD, Zhou B. On the second largest distance eigenvalue. Linear Multilinear Algebra. 2016;64:1887–1898.
- Cvetković DM, Doob M, Sachs H. Spectra of graphs. 3rd ed. Heidelberg-Leipzig: Johann Abrosius Barth Verlag; 1995.