Title of article :
Semi-strong split domination in graphs
Author/Authors :
الوردي، انور نويسنده Alwardi, Anwar , عبادي، كرم نويسنده دانشگاه آزاداسلامي لاهيجان, , , مانريكيو، مارتين نويسنده National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626126 Manrique , Martin , سونار، نانداپا نويسنده Department of Studies in Mathematics, University of Mysore, Mysore-570 006 Soner, Nandappa
Issue Information :
فصلنامه با شماره پیاپی 0 سال 2014
Pages :
13
From page :
51
To page :
63
Abstract :
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 subgraph induced by $V setminus D$ is 1. The minimum cardinality of a semi-strong split dominating set (SSSDS) of G is the semi-strong split domination number of G, denoted $gamma_{sss}(G)$. In this work, we introduce the concept and prove several results regarding it.
Journal title :
Transactions on Combinatorics
Serial Year :
2014
Journal title :
Transactions on Combinatorics
Record number :
1755903
Link To Document :
بازگشت