The focus of this research is on the possible utilization of split domination in graphs across different domains. A dominating set is a set of vertices in a graph where every vertex in the graph is either a member of this set or is connected to at least one vertex in the set. A graph's dominating set is deemed split dominant if removing it from the graph causes the graph to become disconnected. This article examines the various applications of split domination number in the fields of Computer Network and Public Health