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


The least eigenvalue of graphs with given connectivity
Authors:Miao-Lin Ye  Yi-Zheng Fan  Dong Liang
Institution:a School of Mathematical Sciences, Anhui University, Hefei 230039, PR China
b School of Mathematics and Computation Sciences, Anqing Teachers College, Anqing 246011, PR China
c Key Laboratory of IC&SP of Ministry of Education, Anhui University, Hefei 230039, PR China
Abstract:Let G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of G are those of A(G). In this paper, we characterize the graphs with the minimal least eigenvalue among all graphs of fixed order with given vertex connectivity or edge connectivity.
Keywords:05C50  05C40  90C27
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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