Let G = (V,E) be a simple, undirected, finite nontrivial graph. A non empty set DV of vertices in a graph G is a dominating set if every vertex in V-D is adjacent to some vertex in D. The domination number (G) of G is the minimum cardinality of a dominating set. A dominating set D is called a non split locating equitable dominating set if for any two vertices u,wV-D, N(u)D N(w)D, N(u)D=N(w)D and the induced sub graph V-D is connected.The minimum cardinality of a non split locating equitable dominating set is called the non split locating equitable domination number of G and is denoted by nsle(G). In this paper, bounds for nsle(G) and exact values for some particular classes of graphs were found.