期刊文献+

A RELATION BETWEEN THE MATCHING NUMBER AND LAPLACIAN SPECTRUM OF A TREE 被引量:2

A RELATION BETWEEN THE MATCHING NUMBER AND LAPLACIAN SPECTRUM OF A TREE
原文传递
导出
摘要 Let T be a tree with matching number μ(T). In this paper we obtain the following result: If T has no perfect matchings, thenμ(T) is a lower bound for the number of nonzero Laplacian eigenvalues of T which are smaller than 2.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2005年第2期174-178,共5页 系统科学与复杂性学报(英文版)
基金 This research is supported by Anhui provincial Natural Science Foundation, Natural Science Foundation of Department of Education of Anhui Province of China (2004kj027)the Project of Research for Young Teachers of Universities of Anhui Province of China (2003jql01)and the Project of Anhui University for Talents Group Construction.
关键词 TREE laplacian spectrum matching number 调和量算子 光谱 数字匹配 矩阵 特征值 顶集 简单图
  • 相关文献

参考文献6

  • 1G. J. Ming and T. S. Wang, A relation between the matching number and the Laplacian spectrum of a graph, Linear Algebra Appl., 2001, 325: 71-74.
  • 2D. M. Cvetkovid, M. Doob and H. Sachs, Spectra of Graphs-Theory and Applications(2nd ed.),VEB Deutscher Verlag d.Wiss., Berlin, 1982.
  • 3W. N. Anderson and T. D. Morley, Eigenvalues of the Laplacian of a graph, Linear and Multilinear Algebra, 1985, 18: 141-145.
  • 4R. Grone, R. Merris and V. S. Sunder, The Laplacian spectrum of a graph, SIAM J. Matrix Anal. Appl., 1990, 11: 218-238.
  • 5R. Merris, The number of eigenvalues greater than two in the Laplacian spectrum of a graph,Portugal. Math., 1991, 148: 345-349.
  • 6R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra Appl., 1994, 197/198: 143-176.

同被引文献4

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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