Improving McClelland's Lower Bound for Energy

Kinkar Ch Das, S. A. Mojallal, Ivan Gutman

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

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 languageEnglish
Pages (from-to)663-668
Number of pages6
JournalMatch
Volume70
Issue number2
StatePublished - 2013

Fingerprint

Dive into the research topics of 'Improving McClelland's Lower Bound for Energy'. Together they form a unique fingerprint.

Cite this