| http://www.w3.org/ns/prov#value | - A graph is called complemented, if for each vertex of , there is a vertex of (called a complement of ) such that .In this section we will estimate the dominating number and the clique number for and characterize when is complemented.Note that if is a dominating set for , then for each vertex in , we have or or for some .Lemma 11.
|
