Bounds on watching and watching graph products

DOI10.7151/dmgt.2239zbMath1479.05262OpenAlexW2973413571WikidataQ127203986 ScholiaQ127203986MaRDI QIDQ2062673

Danny Dyer, Jared Howell

Publication date: 3 January 2022

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

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

zbMATH Keywords

dominationgraph productswatchman's walk

Mathematics Subject Classification ID

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

Related Items (1)

The watchman's walk problem on directed graphs

Cites Work

• Independent domination of grids
• The Domination Number of Grids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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