A set D of vertices in G is a disjunctive dominating if every vertex not adjacent to or has at least two distance 2 from it G. The domination number, γ2d(G), the minimum cardinality In this paper, we show that be graph order 3, δ(G)≥2 and with no component isomorphic any eight forbidden graphs, then γ2d(G)≤|G|3. Moreover, provide an infinite family graphs attaining bound. addition, also study c...