ON THE COMPLEXITY OF DOMINATING SET PROBLEM FOR SUBCLASSES OF SPLIT GRAPH CLASS |
6 | |
2010 |
scientific article | 519.17 | ||
143-147 | dominating set problem, split graph, computational complexity |
The dominating set problem is known to be NP-complete in the split graph class. The influence of degrees of
some vertices of such graphs on the computational complexity of the problem is studied. |
![]() |