On the diameter of a domination dot-critical graph

A graph G is domination dot-critical, or just dot-critical, if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. In this paper, we study an open question concerning of the diameter of a domination dot-critical graph G.