Let G = (V;E) be a simple graph of order n and size m. An r-matching of G is a set of r edges of G which no two of them have common vertex. The Hosoya index Z(G) of a graph G is defined as the total number of its matchings. An independent set of G is a set of vertices where no two vertices are adjacent. The Merriffield-Simmons index of G is de¯ned as the total number of the independent sets of G. In this paper we obtain Hosoya and Merrifield-Simmons indices of corona of some graphs.