Anwar Alwardi - Department of Studies in Mathematics, University of Mysore, Mysore-۵۷۰۰۰۶ Karnataka, India
Karam Ebadi - National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-۶۲۶۱۲۶, India
Martin Manrique - National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-۶۲۶۱۲۶, India
Nsndappa Soner - Department of Studies in Mathematics, University of Mysore, Mysore-۵۷۰۰۰۶ Karnataka, India

Given a graph G=(V,E)‎, ‎a dominating set D\subseteq V is called a semi-strong split dominating set of G if |V\setminus D|\geq۱ and the maximum degree of the induced subgraph \langle V\setminus D \rangle is ۱‎. ‎The cardinality of a minimum semi-strong split dominating set (SSSDS) of G is the semi-strong split domination number of G‎, ‎denoted \gamma_{sss}(G)‎. ‎In this paper‎, ‎we introduce the concept and prove several results regarding it‎.

split domination, strong split domination, tree