In 1981, Cockayne proved that the calculation of the domination number on arbitrary graph was a NP-hard problem.

• 1981年Cockayne等人证明计算任意图的支配数是一个NP困难问题。