Asset Details
Do you wish to reserve the book?
Graphs with Large Total 2-Rainbow Domination Number
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Graphs with Large Total 2-Rainbow Domination Number
Do you wish to request the book?
Graphs with Large Total 2-Rainbow Domination Number
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Graphs with Large Total 2-Rainbow Domination Number
2018
Overview
Let G = (V, E) be a simple graph with no isolated vertex. A 2-rainbow dominating function (2RDF) of G is a function f from the vertex set V(G) to the set of all subsets of the set {1,2} such that for any vertex v 2 V(G) with f (v) = 0 the condition ... is fulfilled, where N(v) is the open neighborhood of v. A 2-rainbow dominating function f is called a total 2-rainbow dominating function (T2RDF) if the subgraph of G induced by ... has no isolated vertex. The weight of a T2RDF f is defined as ... The total 2-rainbow domination number, γtr2(G), is the minimum weight of a total 2-rainbow dominating function on G. In this paper, we characterize all graphs G whose total 2-rainbow domination number is equal to their order minus one.
Publisher
Springer Nature B.V
Subject
