Let G=(V,E) be graph with V=S_1∪S_2∪S_3∪…S_t∪T , where each S_i (1≤i≤t) is a set of vertices having at least two vertices of the same degree and T=V\∪S_i. The degree splitting graph of G denoted by DS(G) is obtained from G by adding vertices w_1,w_2,…,w_t and joining to each vertex of S_i (1≤i≤t). In this article, we studied the concept of the Steiner global domination number of degree splitting graph of a graph