Let Gk,(k≥0) be the family of graphs that have exactly k cycles. For 0≤k≤3, we compute the Hadwiger number for graphs in Gk and further deduce that the Hadwiger Conjecture is true for such families of graphs.