A method to determine a minimal dominating set of a graphG_0

An operation is defined on a finite connected undirected graph
G_{0}
without loops and multiple edges, and the use of the operation to generate a minimal dominating set of
G_{0}
is illustrated. A method to determine a fairly good approximation of a minimum dominating set is constructed.