The energy of C4-free graphs of bounded degree

https://doi.org/10.1016/j.laa.2007.12.005Get rights and content
Under an Elsevier user license
open archive

Abstract

Answering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, satisfiesμ1++μnn,where μ1,,μn are the eigenvalues of G.

We give some general results and state two conjectures.

AMS classification

05C50

Keywords

Graph energy
Maximum degree
C4-Free graph
Graph eigenvalues

Cited by (0)