Lower bound of the sum of positive eigenvalues of a graph |
| |
| Authors: | Li Jiongsheng Wang Xinmao |
| |
| Institution: | (1) Department of Mathematics, University of Science and Technology of China, 230026 Hefei, China |
| |
| Abstract: | The sum of positive eigenvalues and the number of the edges of a graphG are denoted byS(G) and #E(G) respectively. C. Delorme1] put forward the question: What is the lower bound ofS(G) for a given #E(G)? Is it $\sqrt {\# E(G)} $ ? In this paper we give an affirmative answer to the question. |
| |
| Keywords: | Graph matrix eigenvalue lower bound |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
