<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=169434"><dc:title>The 2-rainbow domination number of Cartesian product of cycles</dc:title><dc:creator>Brezovnik,	Simon	(Avtor)
	</dc:creator><dc:creator>Rupnik Poklukar,	Darja	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>2-rainbow domination</dc:subject><dc:subject>domination number</dc:subject><dc:subject>cartesian product</dc:subject><dc:description>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 cases.</dc:description><dc:date>2025</dc:date><dc:date>2025-05-28 12:46:45</dc:date><dc:type>Neznano</dc:type><dc:identifier>169434</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
