• Jyoti rani
• Prateek Mor

This paper focuses on the domination in graph with some of its application in various fields . Let G = (V,E) be a simple graph. A set of vertices S in a graph G is said to be a dominating set if every vertex is either an element of S or is adjacent to an element of S. A minimal dominating set in a graph G is a dominating set that contains no dominating set as a proper subset. The cardinality of minimum dominating set is called domination number and it is denoted by .Many different types of domination have been researched extensively this paper explores applications of dominating sets.

"Domination in Graph and Some of its applications in various fields", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.322-326, April-2019, Available :http://www.jetir.org/papers/JETIR1904141.pdf

"Domination in Graph and Some of its applications in various fields", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp322-326, April-2019, Available at : http://www.jetir.org/papers/JETIR1904141.pdf