# Maximal non-reducible vertex cover of a graph

Let $G=(V,E)$ be a graph (i.e. an undirected simple finite graph). We say that a vertex cover $V'$ of $G$ is non-reducible if any $V''$ with $V''\subsetneq V'$ is not a vertex cover of $G$. We say that a non-reducible vertex cover $V'$ of $G$ is maximal if for all non-reducible vertex cover $V''$ of $G$ we have $|V''|\le |V'|$. Note that the minimum vertex cover is non-reducible, but of course not necessarily maximal.

What is know about the (time)-complexity of finding a maximal non-reducible vertex cover?

Is there anything known for hypergraphs with multiple edges?

I'm not aware of any literature on this problem per se, however the equivalent Independent Dominating Set problem is quite well studied. An independent dominating set in a graph $G$ is an independent set $I$ such that every vertex not in $I$ has a neighbor in $I$. In the Independent Dominating Set problem input is a graph $G$ and the task is to find a smallest possible independent dominating set. This problem is known to be NP-complete.
The two problems are equivalent because a set $S$ is a minimal vertex cover if and only if $V(G) \setminus S$ is an independent dominating set.