The energy of C4-free graphs of bounded degree

Details The energy of C4-free graphs of bounded degree The energy of C4-free graphs of bounded degree

2007-11-22

arxiv.org/abs/0711.3497v1

Mathematics

Combinatorics

Scientific paper

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, has energy greater that its order. Here, the energy
of a graph is the sum of the moduli of its eigenvalues. We give more general
theorems and state two conjectures.

Affiliated with

Also associated with

No associations

Rating

The energy of C4-free graphs of bounded degree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The energy of C4-free graphs of bounded degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The energy of C4-free graphs of bounded degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310109