After experiment, m(G, k) be the k-matching of graph G and z(G) be the Hosoya index of the graph G. Then z(G) is the total number of m(G, k). We shall investigate the Hosoya index of trees with diameter not more than 4, and characterize its extreme graphs.