In 2005, Lu, Liu and Tian [2] published two inequalities involving the domination number and Laplacian eigenvalues of graphs. A short proof of their results is given, an error is pointed out, and improved inequalities are presented. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:115 / 118
页数:4
相关论文
共 3 条
[1]
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness