A locating-dominating set (LDS) S of a graph G is a dominating set S of G such that for every two vertices u and v in V (G) \ S, N(u) ∩ S ≠ N(v) ∩S. The locating-domination number γL(G) is the minimum cardinality of a LDS of G. Further if S is a total dominating set then S is called a locating-total dominating set. In this paper we determine the domination parameters for corona graph. © Research India Publications.