|
|
|
|
Semi-strong split domination in graphs
|
|
|
|
|
|
|
|
نویسنده
|
الوردی انور ,عبادی کرم ,مانریکیو مارتین ,سونار نانداپا
|
|
منبع
|
transactions on combinatorics - 2014 - دوره : 3 - شماره : 2 - صفحه:51 -63
|
|
چکیده
|
Given a graph $g = (v,e)$, a dominating set $d subseteq v$ is called a semi-strongsplit 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.
|
|
کلیدواژه
|
split domination ,strong split domination ,tree
|
|
آدرس
|
University of Mysore, Department of Studies in Mathematics, University of Mysore, Mysore-570006 Karnataka, India, Kalasalingam University, National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626126, India, Kalasalingam University, National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626126, India, University of Mysore, Department of Studies in Mathematics, University of Mysore, Mysore-570 006, India
|
|
پست الکترونیکی
|
ndsoner@yahoo.co.in
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|