• K.Ameenal Bibi
• A.Lakshmi
• R.Jothilakshmi

Let G = (V, E) be a simple, finite, connected and undirected graph. A non-empty subset D⊆V in a graph G = (V, E) is a distance - 2 dominating set if every vertex in V-D is within distance - 2 of at least one vertex in D. The distance - 2 domination number γ_(≤2) (G) of G equals the minimum cardinality of a distance - 2 dominating set in G. A distance - 2 dominating set D of G is an independent distance - 2 dominating set if the induced sub-graph <D> has no edges. The independent distance - 2 domination number i_(≤2) (G) is the minimum cardinality of a minimal independent distance - 2 dominating set. In this paper, we presented an algorithm for finding an independent distance - 2 dominating set of a graph.

Dominating set, independent set, independent dominating set, distance - 2 dominating set, independent distance - 2 dominating set, independent distance - 2 domination number.

"AN ALGORITHM FOR THE INDEPENDENT DISTANCE - 2 DOMINATING SET OF A GRAPH ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 8, page no.373-377, August-2018, Available :http://www.jetir.org/papers/JETIR1808049.pdf

"AN ALGORITHM FOR THE INDEPENDENT DISTANCE - 2 DOMINATING SET OF A GRAPH ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 8, page no. pp373-377, August-2018, Available at : http://www.jetir.org/papers/JETIR1808049.pdf