arXiv Analytics

Sign in

arXiv:1811.01639 [math.CO]AbstractReferencesReviewsResources

A general lower bound for the domination number of cylindrical graphs

José Juan Carreño, José Antonio Martínez, María Luz Puertas

Published 2018-11-05Version 1

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.

Comments: 12 pages, 3 figures
Categories: math.CO
Subjects: 05C38, 05C76, 05C85
Related articles: Most relevant | Search more
arXiv:1205.5537 [math.CO] (Published 2012-05-24)
On domination of Cartesian product of directed cycles
arXiv:1411.6887 [math.CO] (Published 2014-11-25)
The Cartesian product of graphs with loops
arXiv:math/0511316 [math.CO] (Published 2005-11-12)
Enumeration of perfect matchings of a type of Cartesian products of graphs

Links

Toolbox