Abstract
A lower bound for the energy of a graph is determined, in terms of number of vertices, edges and determinant of the adjacency matrix. It holds for nonsingular graphs, and under certain conditions improves the classical McClelland’s lower bound.
| Original language | English |
|---|---|
| Pages (from-to) | 663-668 |
| Number of pages | 6 |
| Journal | Match |
| Volume | 70 |
| Issue number | 2 |
| State | Published - 2013 |