On Singleton 3-Rainbow Domination of Cylindrical Graphs
Mathematics · 12.08.2026 · 14 (16) · 2917
DOI: 10.3390/math14162917 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 12.08.2026. Verfasst von Janez Žerovnik. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: ARIS, Horizon Europe project Quantum Excellence Centre for Quantum-Enhanced Applications.
Abstract (Originalsprache)
Domination is among the most popular topics in graph theory, both due to its combinatorial appeal and a number of practical applications. Cylindrical graphs are Cartesian products of a path and a cycle. Usually, for some special subfamilies, natural constructions exist that give exact solutions. On the other hand, in general, exact values of invariants on cylindrical graphs are hard to compute. In this paper, tight lower and upper bounds for singleton three-rainbow domination are proven and a subfamily of cylindrical graphs is found for which exact values are provided. The results complement recent findings for singleton two- and four-rainbow domination.
Förderung
- ARIS
- Horizon Europe project Quantum Excellence Centre for Quantum-Enhanced Applications
Zitieren
APA
Žerovnik, J. (2026). On Singleton 3-Rainbow Domination of Cylindrical Graphs. Mathematics, 14(16), 2917. https://doi.org/10.3390/math14162917
Vancouver
Žerovnik J. On Singleton 3-Rainbow Domination of Cylindrical Graphs. Mathematics. 2026;14(16):2917. doi:10.3390/math14162917
BibTeX
@article{erovnik2026,
author = {Žerovnik, Janez},
title = {On Singleton 3-Rainbow Domination of Cylindrical Graphs},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {16},
pages = {2917},
doi = {10.3390/math14162917}
}
EUVIMED