Characterization of some classes of graphs with equal domination number and isolate domination number

Let G be a simple and undirected graph with vertex set V. A set D ⊆ V is called a dominating set of G, if every vertex in V ∖D is adjacent to at least one vertex in D. The minimum cardinality of a ...