This article discusses using domination sets in graph theory to determine the minimum number of surveillance cameras needed to monitor an area. Domination sets identify the fewest number of vertices in a graph that observe all other vertices. The authors propose applying this concept to place cameras so that every point in an area is within viewing range of at least one camera, while using the smallest possible number of cameras.