DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2017-2018): c. 84%

Discussiones Mathematicae Graph Theory

Article in press


Authors:

D. Dyer, J. Howell

Title:

Bounds on watching and watching graph products

Source:

Discussiones Mathematicae Graph Theory

Received: 2018-09-17, Revised: 2019-05-07, Accepted: 2019-07-03, https://doi.org/10.7151/dmgt.2239

Abstract:

A watchman's walk for a graph $G$ is a minimum-length closed dominating walk, and the length of such a walk is denoted $w(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

PDF
Close