  We introduce the concept of distance ideals of graphs, which can be regarded
as a generalization of the Smith normal form and the spectra of the distance
matrix of a graph. We obtain a classification of the graphs with at most one
trivial distance ideal.

Combinatorics