In this article, how the removal of a single vertex from a graph G can change the Connected Majority Domination number is surveyed for any graph G. A graph is Connected Domination Critical if the removal of any vertex ...