• M.Hoorulayeen
• Dr.K.Ameenal Bibi
• T.Aswini

Let G = (V,E) be a simple, finite, undirected and connected graph. A non-empty subset D⊆V is a dominating set of G if every vertex in V-D is adjacent to atleast one vertex in D. The domination number γ(G) is the minimum cardinality taken over all the minimal dominating sets of G. A dominating set D is a total dominating set of G if the induced subgraph <D> has no isolated vertices. The total domination number γ_t (G) is the minimum cardinality taken over all the minimal total dominating sets of G. A total dominating set D⊆V is an accurate total dominating set of G if V-D has no total dominating set of |D|. The accurate total domination number γ_at (G) is the minimum cardinality taken over all the minimal accurate total dominating sets of G. In this paper, the values of γ_a (G) and γ_at (G) are obtained for some special graphs

Dominating set, Total dominating set, Accurate dominating set, Accurate total dominating set, Accurate domination number and Accurate total domination number.

"Accurate domination and Accurate total domination of some special graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.759-770, June 2019, Available :http://www.jetir.org/papers/JETIR1908411.pdf

"Accurate domination and Accurate total domination of some special graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp759-770, June 2019, Available at : http://www.jetir.org/papers/JETIR1908411.pdf