Connected certified domination edge critical and stable graphs

In an isolate-free graph 𝒵 = (V_𝒵, E_𝒵), a set C of vertices is termed as a connected certified dominating set of 𝒵 if, |N_𝒵(u) ∩ (V_𝒵\C)| = 0 or |N_𝒵(u) ∩ (V_𝒵\C)| ≥ 2 ∀u ∈C, and the subgraph 𝒵[C] induced by C is connected. The cardinality of the minimal connected certified dominating set of graph 𝒵 is called the connected certified domination number of 𝒵 denoted by γ_cer^c (Z). In graph 𝒵, if the deletion of any arbitrary edge changes the connected certified domination number, then we call it a connected certified domination edge critical. If the deletion of any random edge does not a ect the connected certified domination number, then we refer to it as a connected certified domination edge stable graph. In this paper, we investigate those graphs which are connected certified domination edge critical and stable upon edge removal. We then study some properties of connected certified domination edge critical and stable graphs.