首页 | 本学科首页   官方微博 | 高级检索  
     


On the Eigenvalue Two and Matching Number of a Tree
Authors:Yi-zheng?Fan  author-information"  >  author-information__contact u-icon-before"  >  mailto:fanyz@mars.ahu.edu.cn"   title="  fanyz@mars.ahu.edu.cn"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Department of Mathematics, Nanjing Normal University, Nanjing, 210097, China;(2) Department of Mathematics, Anhui University, Hefei, 230039, China
Abstract: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.
Keywords:Tree  Laplacian eigenvalues  matching number
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号