Spectra of families of matrices described by graphs, digraphs, and sign patterns
October 23 to October 27, 2006
AIM Research Conference Center, Palo Alto, CA
Organizers:
Leslie Hogben, Richard Brualdi, and Bryan Shader
Workshop topics:
This workshop, sponsored by AIM and the NSF, will bring together
people interested in combinatorial matrix theory and spectral graph
theory for investigation of the following problems:
1) The 2n-conjecture for spectrally arbitrary sign patterns.
2) Determination of the minimum rank of symmetric matrices
described by a graph.
3) The energy of graphs.
During the workshop we hope to resolve the 2n-conjecture and develop
new approaches to the minimum rank problem that will lead to
significant progress in the future. We hope to get a clearer picture
of how energy depends on graph structure, and in particular, to
understand the structure of graphs with maximal or minimal energy.
Application deadline:
July 23, 2006
For more information:
http://aimath.org/ARCC/workshops/matrixspectrum.html