What would be the name of the problem of a vertex cover that covers all the vertices without the requirement of covering all the edges?

Vertex cover has to answer whether or not there is a set of $k$ vertices that covers all the edges of the graph, covering therefore, all the vertices. What is the name of the problem that, similarly to vertex cover, select a subset of $k$ vertices that has direct edges to all the vertices, but without necessarily covering all the edges of the graph?


1 Answer 1


If I understand your description correctly, you are looking for a dominating set.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.