On acyclic systems with minimal Hosoya index

The Hosoya index of a graph is defined as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya index.