Nordhaus-Gaddum results for weakly convex domination number of a graph
暂无分享,去创建一个
Nordhaus-Gaddum results for weakly convex domination number of a graph G are studied.
[1] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[2] Gayathri Mahalingam,et al. Connected domination in graphs , 2005 .
[3] E. A. Nordhaus,et al. On Complementary Graphs , 1956 .