The distance matrix of a tree with weights on its arcs

An ordered pair of two adjacent vertices in a graph is called an arc. In this paper, we give the determinant and the inverse, whenever it exists, of the distance matrix of an arc-weighted tree with arc weights in a ring. These generalize known results. We also give examples that cannot be dealt with by known results. However, our results can be applied for these examples.