Просмотр кода страницы Dominant-matching graph

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

A graph <math>G</math> is called a '''dominant-matching graph''' if <math>\gamma(H) =
\mu(H)</math> for every isolate-free induced subgraph <math>H</math> of <math>G</math>. Here
<math>\gamma(G)</math> is the ''domination number'', and <math>\mu(G)</math> is the ''matching number'' of <math>G</math>.