The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Integer symmetric matrices with spectral radius at most 2.019

Smyth, C (Edinburgh)
Friday 25 January 2008, 14:30-15:00

Seminar Room 1, Newton Institute


All graphs with spectral radius (of their adjacency matrix) at most sqrt(2+sqrt(5)) = 2.05817... are known. In joint work with James McKee, we try to extend this result to general symmetric matrices with integer entries. As is clear from the title, we do not get quite as far. Apart from some trivial examples, all the matrices described by the title are represented by 'charged signed graphs' having adjacency matrices with entries 0,1 or -1.


[pdf ]




The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧