Even time constraints on the watchman's walk

MaRDI QIDQ2848728zbMATH OpenFDO

Authors I. Beaton, R. Begin, Stephen Finbow, C. M. van Bommel

Publication date 26 September 2013

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

dominating setrooted treedominating walkwatchman's walk problem

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Extremal combinatorics (05D99)

Recommendations

• A time-constrained variation of the watchman's walk problem
• Bounds on watching and watching graph products
• The watchman's walk problem on directed graphs
• scientific article; zbMATH DE number 2188604
• Maximum size of a minimum watching system and the graphs achieving the bound
• scientific article; zbMATH DE number 6700524
• scientific article; zbMATH DE number 2114506
• scientific article; zbMATH DE number 1890833
• Downsizing a dominating set
• A note on the total domination number of a tree

Cited in

(6)

• The watchman's walk problem on directed graphs
• Bounds on watching and watching graph products
• scientific article; zbMATH DE number 6700524 (Why is no real title available?)
• scientific article; zbMATH DE number 1890833 (Why is no real title available?)
• A time-constrained variation of the watchman's walk problem
• scientific article; zbMATH DE number 7559442 (Why is no real title available?)

This page was built for publication: Even time constraints on the watchman's walk

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