Energy of Nonsingular Graphs: Improving Lower Bounds

被引:1
作者
Shooshtari, Hajar [1 ]
Rodriguez, Jonnathan [2 ]
Jahanbani, Akbar [1 ]
Shokri, Abbas [3 ]
机构
[1] Azarbaijan Shahid Madani Univ Tabriz, Dept Math, Tabriz, Iran
[2] Univ Antofagasta, Fac Ciencias Basicas, Dept Matemat, Av Angamos 601, Antofagasta, Chile
[3] Azarbaijan Shahid Madani Univ Tabriz, Dept Phys, Tabriz, Iran
关键词
SPECTRAL-RADIUS; LATENT ROOTS; ELECTRON; MATRIX;
D O I
10.1155/2021/4064508
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a simple graph of order n and A be its adjacency matrix. Let lambda(1) >= lambda(2) >= ... >= lambda(n) be eigenvalues of matrix A. Then, the energy of a graph G is defined as epsilon(G) = Sigma(n)(i=1) vertical bar lambda(i)vertical bar. In this paper, we will discuss the new lower bounds for the energy of nonsingular graphs in terms of degree sequence, 2-sequence, the first Zagreb index, and chromatic number. Moreover, we improve some previous well-known bounds for connected nonsingular graphs.
引用
收藏
页数:5
相关论文
共 25 条
[21]  
Kumar R, 2010, J MATH INEQUAL, V4, P399
[22]   Some upper bounds for the energy of graphs [J].
Liu, Huiqing ;
Lu, Mei ;
Tian, Feng .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2007, 41 (01) :45-57
[23]   PROPERTIES OF LATENT ROOTS OF A MATRIX - ESTIMATION OF PI-ELECTRON ENERGIES [J].
MCCLELLAND, BJ .
JOURNAL OF CHEMICAL PHYSICS, 1971, 54 (02) :640-+
[24]   New bounds on the energy of a graph [J].
Shoshtari, Hajar ;
Rodriguez, Jonnathan .
COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2022, 7 (01) :81-90
[25]   On the spectral radius of graphs [J].
Yu, AM ;
Lu, M ;
Tian, F .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 387 :41-49