Bounds on Watching and Watching Graph Products
Discussiones Mathematicae. Graph Theory, Tome 42 (2022) no. 1, pp. 63-79
Voir la notice de l'article provenant de la source Library of Science
A watchman’s walk for a graph G is a minimum-length closed dominating walk, and the length of such a walk is denoted (G). We introduce several lower bounds for such walks, and apply them to determine the length of watchman’s walks in several grids.
Keywords:
watchman’s walk, domination, graph products
@article{DMGT_2022_42_1_a4,
author = {Dyer, Danny and Howell, Jared},
title = {Bounds on {Watching} and {Watching} {Graph} {Products}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {63--79},
publisher = {mathdoc},
volume = {42},
number = {1},
year = {2022},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2022_42_1_a4/}
}
Dyer, Danny; Howell, Jared. Bounds on Watching and Watching Graph Products. Discussiones Mathematicae. Graph Theory, Tome 42 (2022) no. 1, pp. 63-79. http://geodesic.mathdoc.fr/item/DMGT_2022_42_1_a4/