• A.Lakshmi
• K. Ameenal Bibi

A distance - 2 dominating set D V of a graph G is an independent distance - 2 dominating set if the induced sub graph <D> has no edges. The independent distance - 2 domination number is the minimum cardinality of a minimal independent distance - 2 dominating set. In this paper, we defined the notion of independent distance - 2 domination in a graph. We obtained many bounds on independent distance - 2 domination number. Exact values of this new parameter were obtained for some standard graphs and some special graphs. Nordhaus - Gaddum type results were also obtained for this new parameter.

Dominating set, independent dominating set, distance - 2 dominating set, independent distance - 2 dominating set, and independent distance - 2 domination number, cocktail graph, n- Andra ́sfai graph, Harary graph, crown graph, windmill graph, fan graph, musical graph.

"The independent distance - 2 domination in graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 9, page no.619-627, September-2018, Available :http://www.jetir.org/papers/JETIR1809599.pdf

"The independent distance - 2 domination in graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 9, page no. pp619-627, September-2018, Available at : http://www.jetir.org/papers/JETIR1809599.pdf