Graphs with extremal energy tend to have a small number of distinct eigenvalues

author: Dragoš Cvetković, Department of Computer Engineering, University of Belgrade
published: Sept. 7, 2007,   recorded: September 2007,   views: 4196
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

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 sets of graphs. We develop some tools for treating such problems and obtain some partial results. In particular, we show that in many cases the expected extremal graphs with a small number of distinct eigenvalues do not exist and that actual extremal graphs could have a large number of distinct eigenvalues. Zigzag and central circuit structure

See Also:

Download slides icon Download slides: sicgt07_cvetkovic_gwee.pdf (443.4 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: