Upper and lower bounds for the energy of bipartite graphs |
| |
Authors: | Juan Rada Antonio Tineo |
| |
Affiliation: | Departamento de Matemáticas, Facultad de Ciencias, Universidad de Los Andes, 5101 Mérida, Venezuela |
| |
Abstract: | Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp. |
| |
Keywords: | Energy of a graph Lagrange's multiplier rule Spectral moments Balanced incomplete block design Bounds |
本文献已被 ScienceDirect 等数据库收录! |
|