scientific article; zbMATH DE number 1890833

MaRDI QIDQ4800271zbMATH OpenFDO

Authors

Publication date 27 November 2003

zbMATH Keywords

dominating set

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 1472156
• A time-constrained variation of the watchman's walk problem
• Even time constraints on the watchman's walk
• The watchman's walk problem on directed graphs
• Maximum size of a minimum watching system and the graphs achieving the bound

Cited in

(8)

• The Gilbert arborescence problem
• The watchman's walk problem on directed graphs
• scientific article; zbMATH DE number 1472156 (Why is no real title available?)
• Introducing 3-path domination in graphs
• Bounds on watching and watching graph products
• The complexity of monitoring a network with both watchers and listeners
• Even time constraints on the watchman's walk
• A time-constrained variation of the watchman's walk problem

This page was built for publication:

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