By evaluating the dynamics of the CCDN when edges are removed from a graph, this paper focuses on the relatively new idea of certified domination in domination theory, which was first introduced in 2020. The paper provides characterizations, propositions, and structural properties for both classes of graphs. To be specific, we focus on derivation of the CCDN edge critical graphs for categorizing generalized orientation.