A general lower bound for the domination number of cylindrical graphs
Combinatorics
2024-09-25 v1
Abstract
In this paper we present a lower bound for the domination number of the Cartesian product of a path and a cycle, that is tight if the length of the cycle is a multiple of five. This bound improves the natural lower bound obtained by using the domination number of the Cartesian product of two paths, that is the best one known so far.
Cite
@article{arxiv.1811.01639,
title = {A general lower bound for the domination number of cylindrical graphs},
author = {José Juan Carreño and José Antonio Martínez and María Luz Puertas},
journal= {arXiv preprint arXiv:1811.01639},
year = {2024}
}
Comments
12 pages, 3 figures