|
|||||
|
|
Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter |
|
| Authors: | LIU Rui-fang ZHAI Ming-qing SHU Jin-long |
| Affiliation: | 1. Department of Mathematics, East China Normal University, Shanghai 200241, China 2. Department of Mathematics, East China Normal University, Shanghai 200241, China;Department of Mathematics, Chuzhou University, Chuzhou 239012, China 3. Department of Mathematics, East China Normal University, Shanghai 200241, China;Shanghai Key Laboratory of Trustworthy Computing, Fast China Normal University, Shanghai 200062, China |
| Abstract: | 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 inv... |
| Keywords: | lower bound diameter eigenvalues |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |