Bounds on watching and watching graph products

DOI10.7151/DMGT.2239MaRDI QIDQ2062673zbMATH OpenOpenAlexWikidataFDO

Authors Danny Dyer, Jared Howell

Publication date 3 January 2022

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2239

zbMATH Keywords

dominationgraph productswatchman's walk

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• The watchman's walk problem on directed graphs
• scientific article; zbMATH DE number 6700524
• scientific article; zbMATH DE number 2114506
• A time-constrained variation of the watchman's walk problem
• Even time constraints on the watchman's walk

Cites work

• A time-constrained variation of the watchman's walk problem
• Eternal domination on 3 n grid graphs
• Even time constraints on the watchman's walk
• scientific article; zbMATH DE number 6700524 (Why is no real title available?)
• scientific article; zbMATH DE number 5556285 (Why is no real title available?)
• scientific article; zbMATH DE number 1472156 (Why is no real title available?)
• scientific article; zbMATH DE number 1890833 (Why is no real title available?)
• scientific article; zbMATH DE number 2114506 (Why is no real title available?)
• Independent domination of grids
• The domination number of grids
• Watchman's walk of Steiner triple system block intersection graphs

Cited in

(7)

• Even time constraints on the watchman's walk
• A time-constrained variation of the watchman's walk problem
• Watchman's walk of Steiner triple system block intersection graphs
• scientific article; zbMATH DE number 2114506 (Why is no real title available?)
• Maximum size of a minimum watching system and the graphs achieving the bound
• The watchman's walk problem on directed graphs
• Watchman's walk on complete multipartite digraphs

This page was built for publication: Bounds on watching and watching graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2062673)