20.500.12556/RUL-170865 The 2-rainbow domination number of Cartesian bundles over cycles A k-rainbow dominating function (kRDF) of G assigns subsets of {1, 2, ..., k} to vertices, such that for vertex v with f(v) = ∅,▫$U_{u∈N(v)}$▫f(u) = {1, 2, ..., k}. The weight w(f) of kRDF f is w(f) =▫$\Sigma_{v∈V(G)}$▫|f(v)|. The minimum weight of a kRDF of G is the k-rainbow domination number denoted by ▫$\gamma_{rk}$▫(G). This paper focuses on the 2-rainbow domination number of Cartesian graph bundles of cycles over cycles, extending recent results for Cartesian product of cycles. Exact values are given for certain infinite families, and tight lower and upper bounds are established for general case. 2-rainbow domination domination numbers graph bundles 2-mavrična dominacija dominacijsko število kartezični produkt grafov true false true Angleški jezik Slovenski jezik Članek v reviji 2025-07-19 04:16:08 2026-05-15 09:08:04 2026-05-16 04:59:39 0000-00-00 00:00:00 2025 0 0 Str. 641–659 Vol. 33 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 1613-9178 10.1007/s10100-024-00949-6 216758531 Brezovnik,_Rupnik,_Zerovnik_-_The_2‑rainbow_domination_number_....pdf Brezovnik,_Rupnik,_Zerovnik_-_The_2‑rainbow_domination_number_....pdf 1 F329DB45A4BEB34EA1AF4F02A749D00A b923319c06acc5b29525b6a070e694bc67446bbeafaccc940646ecca43d9f8b2 c1da65bf-6602-11f0-9328-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=213160 https://link.springer.com/article/10.1007/s10100-024-00949-6 1 57127c3d-6446-11f0-9328-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=213134 Fakulteta za strojništvo 0 0 0