Dominant-covering graph

Dominant-covering graph --- доминантно-покрывающий граф.

A graph [math]\displaystyle{ G }[/math] is called a dominant-covering graph if [math]\displaystyle{ \gamma(H) = \tau(H) }[/math] for every isolate-free induced subgraph [math]\displaystyle{ H }[/math] of [math]\displaystyle{ G }[/math]. Here [math]\displaystyle{ \gamma(G) }[/math] is the domination number, and [math]\displaystyle{ \tau(G) }[/math] is the vertex-coverung number of [math]\displaystyle{ G }[/math].