期刊文献+

On the Eigenvalue Two and Matching Number of a Tree

On the Eigenvalue Two and Matching Number of a Tree
原文传递
导出
摘要 In [6],Guo and Tan have shown that 2 is a Laplacian eigenvalue of any tree with perfect matchings.For trees without perfect matchings,we study whether 2 is one of its Laplacian eigenvalues.If the matchingnumber is 1 or 2,the answer is negative;otherwise,there exists a tree with that matching number which has (hasnot) the eigenvalue 2.In particular,we determine all trees with matching number 3 which has the eigenvalue2. In [6],Guo and Tan have shown that 2 is a Laplacian eigenvalue of any tree with perfect matchings.For trees without perfect matchings,we study whether 2 is one of its Laplacian eigenvalues.If the matchingnumber is 1 or 2,the answer is negative;otherwise,there exists a tree with that matching number which has (hasnot) the eigenvalue 2.In particular,we determine all trees with matching number 3 which has the eigenvalue2.
作者 Yi-zhengFan
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2004年第2期257-262,共6页 应用数学学报(英文版)
基金 The project item of scientific research fund for young teachers of colleges and universities of Anhui province (Grant No.2003jq101) and the project item of Anhui University fund for talents group construction,and National Natural Science Foundation of Ch
关键词 TREE Laplacian eigenvalues matching number Tree Laplacian eigenvalues matching number
  • 相关文献

参考文献12

  • 1Anderson, W.N., Morley, T.D. Eigenvalues of the Laplacian of a graph. Linear Algebra and Multilinear Algebra, 18:141-145 (1985).
  • 2Fan, Y.Z. On graphs with small number of Laplacian eigenvalues greater than two. Linear Algebra Appl.,360:207-213 (2003).
  • 3Faria. I. Permanental roots and the star deuree of a graph. Linear Algebra Appl., 64:255-265 (1985).
  • 4Fiedler, M. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak MathematleM Journal, 25:607-618 (1975).
  • 5Grone, R., Merris, R., Sunder, V.S. The Laplacian spectrum of a graph. SlAM J. Matrix Anal. Appl., 11:218-238 (1990).
  • 6Guo, J., 2Fan, S., A relation between the matching number and the Laplacian spectrum of a graph. Linear Algebra Appl., 325:71-74 (2001).
  • 7Guo, J., Tan, S. On the spectral radius of trees. Linear Algebra Appl., 329:1-8 (2001).
  • 8Hou, Y., Li, J. Bounds on the largest eigenvalues of trees with given size of matching. Linear Algebra Appl., 342:203-217 (2002).
  • 9Merris, R. The number of eigenvalues greater than two in the Laplacian spectrum of a graph. Portugal.Math., 148:345-349 (1991).
  • 10Merris, R. Laplacian matrices of graphs: a survey. Linear Algebra Appl., 197/198:143-176 (1994).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部