5 research outputs found
Total -Rainbow domination numbers in graphs
Let be an integer‎, ‎and let be a graph‎. ‎A {\it‎
‎-rainbow dominating function} (or a {\it -RDF}) of is a‎
‎function from the vertex set to the family of all subsets‎
‎of such that for every with‎
‎‎, ‎the condition is fulfilled‎, ‎where is‎
‎the open neighborhood of ‎. ‎The {\it weight} of a -RDF of‎
‎ is the value ‎. ‎A -rainbow‎
‎dominating function in a graph with no isolated vertex is called‎
‎a {\em total -rainbow dominating function} if the subgraph of ‎
‎induced by the set has no isolated‎
‎vertices‎. ‎The {\em total -rainbow domination number} of ‎, ‎denoted by‎
‎‎, ‎is the minimum weight of a total -rainbow‎
‎dominating function on ‎. ‎The total -rainbow domination is the‎
‎same as the total domination‎. ‎In this paper we initiate the‎
‎study of total -rainbow domination number and we investigate its‎
‎basic properties‎. ‎In particular‎, ‎we present some sharp bounds on the‎
‎total -rainbow domination number and we determine the total‎
‎-rainbow domination number of some classes of graphs‎.