Graphs with extremal energy should have a small number of distinct eigenvalues

Details Graphs with extremal energy should have a small number of distinct eigenvalues Graphs with extremal energy should have a small number of distinct eigenvalues

2007-10-30

arxiv.org/abs/0710.5669v1

Cvetkovi\' c D., Grout J., Maximal energy graphs should have a small number of distinct eigenvalues, Bull. Acad. Serbe Sci. Ar

Mathematics

Combinatorics

17 pages; contains a SAGE program and minor grammatical corrections that are not contained in the published version

Scientific paper

The sum of the absolute values of the eigenvalues of a graph is called the energy of the graph. We study the problem of finding graphs with extremal energy within specified classes of graphs. We develop tools for treating such problems and obtain some partial results. Using calculus, we show that an extremal graph ``should'' have a small number of distinct eigenvalues. However, we also present data that shows in many cases that extremal graphs can have a large number of distinct eigenvalues.

Affiliated with

Also associated with

No associations

Rating

Graphs with extremal energy should have a small number of distinct eigenvalues 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 Graphs with extremal energy should have a small number of distinct eigenvalues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs with extremal energy should have a small number of distinct eigenvalues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365642