Bounds for graph energy in terms of vertex covering and clique numbers

Hilal A. Ganie, U. Samee, S. Pirzada, Ahmad M. Alghamadi

Abstract


Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1nλi∣. In this paper, we obtain the upper bounds for the energy E(G) in terms of the vertex covering number τ, the clique number ω, the number of edges m, maximum vertex degree d1 and second maximum vertex degree d2 of the connected graph G. These upper bounds improve some of the recently known upper bounds.


Keywords


graph energy, vertex covering number, clique number, maximum degree

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2019.7.2.9

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats