This paper shows by counterexamples that the algorithms of finding maximum independent set and minimum dominating set of a graph in [1] are wrong.

• 用反例证明了文[1]中的最大独立集算法和最小支配集算法的结论都是错误的，因而图论中独立支配集的求解问题并没有解决.