Summary: 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 1\) and the maximum degree of the induced subgraph \(\langle V \setminus D \rangle\) is 1. The cardinality of a minimum semi-strong split dominating set (SSSDS) of \(G\) is the semi-strong split domination number of \(G\), denoted \(\gamma_{\mathrm{sss}}(G)\). In this paper, we introduce the concept and prove several results regarding it.