%0 Journal Article
%T Strong efficient domination and strong independent saturation number of graphs
%A N. Meena
%A A. Subramanian
%A V. Swaminathan
%J International Journal of Mathematics and Soft Computing
%D 2013
%I SweDha Publication
%X A subset S of V(G) of a graph G is called a strong (weak) efficient dominating set of G if for every v V(G), ©¦Ns[v]¡ÉS©¦= 1 (©¦Nw[v]¡ÉS©¦= 1 ) where Ns(v) = { u V(G) : uv E(G), deg(u) ¡Ý deg(v) } and Nw(v) = { u V(G) : uv E(G), deg(v) ¡Ý deg(u)}, Ns[v] = Ns(v) {v}, Nw[v] = Nw(v) {v}. The minimum cardinality of a strong (weak) efficient dominating set is called strong (weak) efficient domination number of G and is denoted by se (G) ( we (G)). A graph G is strong efficient if there exists a strong efficient dominating set.
%K Strong efficient dominating set
%K strong independent saturation number.
%U http://ijmsc.com/index.php/ijmsc/article/view/196/pdf_25