University of IsfahanTransactions on Combinatorics2251-86573220140601Semi-strong split domination in graphs5163485710.22108/toc.2014.4857ENAnwarAlwardiDepartment of Studies in Mathematics, University of Mysore, Mysore-570006
Karnataka, IndiaKaramEbadiNational Centre for Advanced Research in Discrete Mathematics (n-CARDMATH),
Kalasalingam University,
Anand Nagar, Krishnankoil-626126, IndiaMartinManriqueNational Centre for Advanced Research in Discrete Mathematics (n-CARDMATH),
Kalasalingam University,
Anand Nagar, Krishnankoil-626126, IndiaNsndappaSonerDepartment of Studies in Mathematics, University of Mysore, Mysore-570006
Karnataka, IndiaJournal Article20130927Given a graph $G=(V,E)$, a dominating set $Dsubseteq V$ is called a <em>semi-strong split dominating set</em> of $G$ if $|Vsetminus D|geq1$ and the maximum degree of the induced subgraph $langle Vsetminus D rangle$ is $1$. The cardinality of a minimum semi-strong split dominating set (SSSDS) of $G$ is the <em>semi-strong split domination number</em> of $G$, denoted $gamma_{sss}(G)$. In this paper, we introduce the concept and prove several results regarding it.https://toc.ui.ac.ir/article_4857_edc54d4936fa07845b5179f7134b4379.pdf