Ordering Trees with Perfect Matchings by Their Wiener Indices

摘要

The Wiener index of a connected graph is the sum of all pairwise distances of vertices of the graph. In this paper, we consider the Wiener indices of trees with perfect matchings, characterizing the eight trees with smallest Wiener indices among all trees of order 2m (m ≥ 11) with perfect matchings.