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.
机构:
Department of Industrial design, College of Fine Arts, University of Tehran, Tehran, IranDepartment of Industrial design, College of Fine Arts, University of Tehran, Tehran, Iran
Ghareghani, Narges
Peterin, Iztok
论文数: 0引用数: 0
h-index: 0
机构:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia
Institute of Mathematics, Physics and Mechanics, Ljubljana, SloveniaDepartment of Industrial design, College of Fine Arts, University of Tehran, Tehran, Iran
Peterin, Iztok
Sharifani, Pouyeh
论文数: 0引用数: 0
h-index: 0
机构:
Department of Computer Science, Yazd University, Yazd, IranDepartment of Industrial design, College of Fine Arts, University of Tehran, Tehran, Iran