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

作者：Huang, Shenwei; Shan, Erfang^*

来源：Networks, 2011, 57(2): 115-116.

DOI：10.1002/net.20390

• paired-domination number
• upper bound
• minimum degree

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.

• 出版日期2011-3
• 单位上海大学