The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, among all the trees with n vertices and k pendent vertices, we determine the trees with the first [n - k + 1/2] largest Merrifield-Simmons index and the trees ...
