In 1971, Graham and Pollack established a relationship between the number of negative eigenvalues of the distance matrix and the addressing problem in data communication systems. They also proved that the determinant of the distance matrix of a tree is function of the number of vertices only. Since then several mathematicians were interested in studying the spectral properties of the distance matrix of a connected graph. Computing the distance characteristic polynomial and its coefficients was the first research subject of interest. Thereafter, the eigenvalues attracted much more attention. In the present paper, we report on the results related to the distance matrix of a graph and its spectral properties.
Paru en novembre 2013 , 63 pages