The difference between the domination nu
โ
Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 325 KB
The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph