The domination chain , which holds for any graph , is the subject of much research. In this paper, we consider the maximum number of edges in a graph having one of these domination chain parameters equal to through a unique realization. We show that a specialization of the domination chain still holds in this setting.