The 2-rainbow domination number of Cartesian bundles over cycles

A k-rainbow dominating function (kRDF) f of G assigns subsets of $$\{1,2,\ldots ,k\}$$ to vertices, such that for vertex v with $$f(v)=\emptyset$$ , $$\bigcup \nolimits _{u\in N(v)}f(u)=\{1,2,\ldots ,k\}$$ . The weight w(f) of kRDF f is $$w(f)=\sum _{v\in V(G)}\left| f(v)\right|$$ . 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.

Authors

Institutions

Publication Details

Journal
Central European Journal of Operations Research
Published
2024-11-27
DOI
https://doi.org/10.1007/s10100-024-00949-6
Citations
4
Primary Topic
Advanced Differential Equations and Dynamical Systems
Type
article
Field-Weighted Citation Impact
4.05

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The 2-rainbow domination number of Cartesian bundles over cycles

Darja Rupnik Poklukar, Simon Brezovnik, Janez Žerovnik
4 citations
Central European Journal of Operations Research
Advanced Differential Equations and Dynamical Systems
4.05
article

The 2-rainbow domination number of Cartesian bundles over cycles

Darja Rupnik Poklukar, Simon Brezovnik, Janez Žerovnik
article en
4 citations

Abstract

A k-rainbow dominating function (kRDF) f of G assigns subsets of $$\{1,2,\ldots ,k\}$$ to vertices, such that for vertex v with $$f(v)=\emptyset$$ , $$\bigcup \nolimits _{u\in N(v)}f(u)=\{1,2,\ldots ,k\}$$ . The weight w(f) of kRDF f is $$w(f)=\sum _{v\in V(G)}\left| f(v)\right|$$ . 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.

Central European Journal of Operations ResearchVol. 33(3)
University of Ljubljana (SI), Higher Education Centre Novo Mesto (SI), Institute of Mathematics, Physics, and Mechanics (SI)
Javna Agencija za Raziskovalno Dejavnost RS
Openalex Percentile: Top 5%
Advanced Differential Equations and Dynamical Systems
4.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.