These questions deal with polygonal guarding:(adsbygoogle = window.adsbygoogle || []).push({});

a) Suppose P is a simple polygon where g(P) = 2. Prove or disprove that P can always be guarded by two guards that can always see one another (ie the definition of visibility, but not clear visibility)

To disprove all is needed is a counterexample, to prove, a short justification to convince the reader of the truth of the claim is needed, not necessarily a formal proof.

b) Again suppose P is a simple polygon with g(P) = 2. Prove or disprove that P always has a guard network of at most 3.

c) Now suppose that P is a simple polygon with g(P) = 3. Prove or disprove that P always has a guard network of at most 4.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Graph Theory problems

**Physics Forums | Science Articles, Homework Help, Discussion**