Connected cototal domination number of a graph
|
|
|
|
|
|
|
|
نویسنده
|
Basavanagoud B. ,Hosamani Sunilkumar M.
|
|
منبع
|
transactions on combinatorics - 2012 - دوره : 1 - شماره : 2 - صفحه:17 -26
|
|
چکیده
|
A dominating set d subseteq v of a graph g = (v;e) is said to be a connected cototal dominating set if (d) is connected and (v- d) 6 neq varnothing , contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of d is connected cototal dominating set. the connected cototal domination number γccl(g) of g is the minimum cardinality of a minimal connected cototal dominating set of g. in this paper, we begin an investigation of connected cototal domination number and obtain some interesting results
|
|
کلیدواژه
|
domination number; connected domination number; cototal domination number and connected cototal domination number
|
|
آدرس
|
Karnatak University, Department of Mathematics, India, Karnatak University, Department of Mathematics, India
|
|
پست الکترونیکی
|
sunil.india22@gmail.com
|
|
|
|
|
|
|