In 1996, Reed proved that the domination number of every -vertex graph with minimum degree at least 3 is at most . This bound is sharp for cubic graphs if there is no restriction on connectivity. In this paper we show that for every -vertex cubic connected graph if . Note that Reed’s conjecture that for every connected cubic -vertex graph is not true.