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


Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
Authors:Mingqing Zhai  Ruifang Liu
Institution:a Department of Mathematics, East China Normal University, Shanghai, 200241, China
b Department of Mathematics, Chuzhou University, Anhui, Chuzhou, 239012, China
c Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China
Abstract:Let U(n,d) be the set of unicyclic graphs on n vertices with diameter d. In this article, we determine the unique graph with minimal least eigenvalue among all graphs in U(n,d). It is found that the extremal graph is different from that for the corresponding problem on maximal eigenvalue as done by Liu et al. H.Q. Liu, M. Lu, F. Tian, On the spectral radius of unicyclic graphs with fixed diameter, Linear Algebra Appl. 420 (2007) 449-457].
Keywords:Unicyclic graph  Least eigenvalue  Diameter
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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