Semi-strong split domination in graphs

نویسندگان
Manrique, Martin ID 1
Soner, Nsndappa ID 2
Alwardi, Anwar ID 3
Ebadi, Karam ID 4

1 National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626126, India

2 Department of Studies in Mathematics, University of Mysore, Mysore-570006 Karnataka, India

3 Department of Studies in Mathematics, University of Mysore, Mysore-570006 Karnataka, India

4 National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626126, India

doi
10.22108/toc.2014.4857
چکیده

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|\geq1$ 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_{sss}(G)$‎. ‎In this paper‎, ‎we introduce the concept and prove several results regarding it‎.

کلیدواژه‌ها
split domination, strong split domination, tree