• N. Meenal
• R. Rathika2
• A. Porselvi3

Let G (V, E) be a simple, finite, undirected connected graph. A non – empty set S Í V of a graph G is a dominating set, if every vertex in V – S is adjacent to atleast one vertex in S. A dominating set S Í V is called a locating dominating set, if for any two vertices v, w Î V – S, N(v) Ç S ¹ N(w) Ç S. The locating domination number gld is the minimum cardinality of a locating dominating set. In this paper, the location domination number for some special types of graphs namely like Fan, Sun graph, Jelly Fish graph, Umbrella graph and Lotus graph are studied.

Dominating Set, Locating Dominating Set and Locating Dominating Number.

" LOCATING DOMINATION NUMBER FOR SOME SPECIAL TYPES OF GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.607-610, January-2019, Available :http://www.jetir.org/papers/JETIR1901681.pdf

" LOCATING DOMINATION NUMBER FOR SOME SPECIAL TYPES OF GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp607-610, January-2019, Available at : http://www.jetir.org/papers/JETIR1901681.pdf