Derya Doğan DURGUNFerhan Nihan ALTUNDAĞ2024-07-242024-07-2420161305-130Xhttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/24652A 2-rainbow domination function of a graph G is a function f that assigns to each vertex a set of colors chosen from the set {1,2}, such that for any ? ( ), ( ) = ? implies ? ? ( ) | ( )| ={1,2}. The 2-rainbow domination number 2( ) of a graph G is minimum w ( ) = ? ? ( )| ( )|over all such functions f. In this paper, we show that upper bounds of 2-rainbow domination numbers of several classes of graphs.engAraştırma Makalesi