Linear and Multilinear Algebra · 2008 · 15 citations · 8 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsDirected Acyclic GraphsGeometric GraphsGraph AlgorithmsGraph TheoryAlgebraic Graph TheoryDistance MatricesMetric Graph TheoryNormal Forms
Let G be a connected graph and D(G) be its distance matrix. In this article, the Smith normal forms of the integer matrices D(G) are determined for trees, wheels, cycles, complements of cycles and are reduced for complete multipartite graphs.
8
Distance matrix polynomials of trees
R. L. Graham, László Lovász · Advances in Mathematics · 1978 · 201 citations
On the Sandpile Group of Dual Graphs
Robert Cori, Dominique Rossin · European Journal of Combinatorics · 2000 · 169 citations
The distance spectrum of a tree
Russell Merris · Journal of Graph Theory · 1990 · 107 citations