Accurate Connected Domination in Graphs (ACD)

If V-D does not have a dominating set of cardinality D, then a graph G’s dominating set D is an accurate dominating set. If the < D > is connected, then it is considered as an ACDS. An ACD number γ ac (G) represents the ACDS’s minimum cardinality. we investigated the new parameters, bounds, and precise values for γ ac (G). Also got the results for a few common graphs.