Dominant-matching graph

Dominant-matching graph --- домиинантный граф паросочетания.

A graph [math]\displaystyle{ G }[/math] is called a dominant-matching graph if [math]\displaystyle{ \gamma(H) = \mu(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{ \mu(G) }[/math] is the matching number of [math]\displaystyle{ G }[/math].