Equitably strong non-split equitable domination in graphs

In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studied in [7]. V.R. Kulli and B. Janakiram defined strong non - split domination in a graph [5]. In this paper, the equitable version of this new type of domination is studied.