A Note on the Upper Bound for the Paired-Domination Number of a Graph with Minimum Degree At Least Two

摘要

In this note, we give a counter example to show that the proof of a main result obtained by Haynes and Slater (Networks 32 (1998), 199-206, Theorem 12) is inaccurate. Here, we give a complete proof of the result.