On graphs whose energy exceeds the number of vertices

被引:43
作者
Gutman, Ivan [1 ]
机构
[1] Univ Kragujevac, Fac Sci, Kragujevac 34000, Serbia
关键词
Graph spectrum; Energy (of graph);
D O I
10.1016/j.laa.2007.09.024
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a graph on n vertices, and let lambda(1), lambda(2), ..., lambda(n) the eigenvalues of a (0, 1)-adjacency matrix of G. The energy of G is E = Sigma(n)(i=1) vertical bar lambda(i)vertical bar. We characterize several classes of graphs for which E >= n. (C) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码:2670 / 2677
页数:8
相关论文
共 13 条