Abstract: The Hosoya index of a simple graph G is defined to be the total number of its matchings. A graph G is said to a be cycle-block graph if every block of G is a cycle. In the paper, we will determine the smallest Hosoya index of cycle-block graphs.