Open AccessBounds on watching and watching graph products
Author(s) -
Danny Dyer,
Jared Howell
Publication year - 2019
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2239
Subject(s) - mathematics , combinatorics , graph , discrete mathematics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom