Main Article Content
A graph G consists of a pair (V (G), X (G)) where V(G) is a non-empty finite set whose elements are called points or vertices and (G) is a set of unordered pairs of distinct element of V(G). In graph theory, planar graph is also be one of the part. A graph G is said to be a planar if it can be represent on a plane in such a fashion that the vertices are all distinct points, edges and no two edges meet one another except their terminals. A set S of vertices of G is dominating set if every vertex in V (G) is adjacent to at least one vertex in S. In this paper, we have founded the result on independent domination in planar graph.