期刊文献+

Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter

Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter
下载PDF
导出
摘要 The eigenvalues of graphs play an important role in the fields of quantum chemistry, physics, computer science, communication network, and information science. Particularly, they can be interpreted in some situations as the energy levels of an electron in a molecule or as the possible frequencies of the tone of a vibrating membrane. The diameter of a graph, the maximum distance between any two vertices of a graph, has great impact on the service quality of communication networks. So we were motivated to investigate the sharp lower bound of the least eigenvalue of graphs with given diameter. Let gn. d be the set of graphs on n vertices with diameter d. For any graph G ∈ gn, d, by considering the least eigenvalue of its connected spanning bipartite subgraph, we obtained the sharp lower bound of the least eigenvalue of graph G. Furthermore, an upper bound of Laplacian spectral radius of graph G was given. The eigenvalues of graphs play an important role in the fields of quantum chemistry,physics, computer science, communication network, and information science. Particularly,they can be interpreted in some situations as the energy levels of an electron in a molecule or as the possible frequencies of the tone of a vibrating membrane.The diameter of a graph,the maximum distance between any two vertices of a graph, has great impact on the service quality of communication networks. So we were motivated to investigate the sharp lower bound of the least eigenvalue of graphs with given diameter. Let n, d be the set of graphs on n vertices with diameter d. For any graph G∈n,d,by considering the least eigenvalue of its connected spanning bipartite subgraph, we obtained the sharp lower bound of the least eigenvalue of graph G. Furthermore,an upper bound of Laplacian spectral radius of graph G was given.
出处 《Journal of Donghua University(English Edition)》 EI CAS 2009年第4期435-437,共3页 东华大学学报(英文版)
基金 National Key Basic Research Programof China (973,No.2006CB805901) National Natural Science Foundationsof China (No.10671074and No.60673048) Natural Science Foundation of Education Ministry of Anhui Province,China ( No.KJ2009B002)
关键词 lower bound DIAMETER EIGENVALUES 最小特征值 直径 下界 夏普 通信网络 计算机科学 量子化学 信息科学
  • 相关文献

参考文献10

  • 1Cvetkovi′cD M,,Doob M,Sachs H.Spectra of Graphs[ M][]..1995
  • 2Zhai M Q,Liu R F,Shu J L.On the Spectral Radius of Bipartite Graphs with Given Diameter[].Linear Algebra and Its Applications.2009
  • 3Yuan Hong and Jin-Long Shu.Sharp lower bounds of the least eigenvalue of planar graphs[].Linear Algebra and Its Applications.1999
  • 4HONG Yuan.On the least eigenvalues of a graph[].Systems Science.1993
  • 5CAO Da-song,HONG Yuan.The distribution of eigenvalues of graphs[].Linear Algebra and Its Applications.1995
  • 6E.R. van Dam,R.E. Kooij.The minimal spectral radius of graphs with a given diameter[].Linear Algebra and Its Applications.2007
  • 7Ji-Ming Guo and Jia-Yu Shao.On the spectral radius of trees with fixed diameter[].Linear Algebra and Its Applications.2006
  • 8Lu Mei,Zhang Lianzhu,Tian Feng.Lower bounds of the Lapla-cian spectrum of graphs based on diameter[].Linear Algebra and Its Applications.2007
  • 9H.Q. Liu,M. Lu,F. Tian.On the spectral radius of unicyclic graphs with fixed diameter[].Linear Algebra and Its Applications.2007
  • 10E.R. van Dam.Graphs with given diameter maximizing the spectral radius[].Linear Algebra and Its Applications.2007

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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