392 KB36 KB200820252025Brezovnik, SimonRupnik Poklukar, DarjaŽerovnik, Janez17 str.letnik:25številka:3DOI:10.26493/1855-3974.3168.74dISSN:1855-3966COBISSID_HOST:212017155URN:URN:NBN:SI:doc-8F13HQCAenUniverza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologijeArs mathematica contemporanea2-mavrična dominacija2-rainbow dominationcartesian productdominacijsko številodomination numberkartezični produkt grafovThe 2-rainbow domination number of Cartesian product of cycles|A k-rainbow dominating function (kRDF) of G is a function that assigns subsets of {1, 2, ..., k} to the vertices of G such that for vertices v with f(v) = Ř we have Uu?N(v)f(u) = {1, 2, ..., k}. The weight w(f) of a kRDF f is defined as w(f) = P v?V(G)|f(v)|. The minimum weight of a kRDF of G is called the k-rainbow domination number of G, which is denoted by ?rk(G). In this paper, we study the 2-rainbow domination number of the Cartesian product of two cycles. Exact values are given for a number of infinite families and we prove lower and upper bounds for all other casesTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije