Let G be a simple, finite and undirected graph. A set \(L \subseteq V(G)\) is a locating-dominating set (LD-set, for short) of G if L is a dominating set of G and \(N(u) \cap L \ne N(v) \cap L\) for all distinct vertices \(u,v \in V(G) - L\) , where N(x) is the open neighborhood of x. The minimum cardinality of an LD-set of G is denoted by \(\gamma _L(G)\) . A graph is a split graph if its vertices set can be partitioned into an independent set and a clique. We present closed formulas for \(\gamma _L\) in complete split graphs and split corona graphs. Moreover, we propose a way to reduce split graphs with many twin vertices.
