Skip to main navigation Skip to search Skip to main content

Upper Bounds for the Energy of Graphs

  • Sungkyunkwan University

Research output: Contribution to journal › Article › peer-review

Abstract

The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. In this paper we present some new upper bounds for E(G) in terms of number of vertices, number of edges, clique number, minimum degree, and the first Zagreb index.

Original languageEnglish
Pages (from-to)657-662
Number of pages6
JournalMatch
Volume70
Issue number2
StatePublished - 2013

Fingerprint

Dive into the research topics of 'Upper Bounds for the Energy of Graphs'. Together they form a unique fingerprint.

Cite this