Get access

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. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(2), 115–116 2011