Eigenvalues, multiplicities and graphs
Add to your list(s)
Download to your calendar using vCal
- Charles Johnson (College of William and Mary)
- Thursday 09 February 2012, 15:00-16:00
- MR14, CMS.
If you have a question about this talk, please contact ai10.
Given an undirected graph G, we consider the set H(G) of all
Hermitian matrices with graph G. This places no restrictions on the
diagonal entries, besides that they are real. Among matrices in H(G),
the possible lists of multiplicities for the eigenvalues are of
interest. There has now been considerable work on what these lists
might be, especially for trees, and we survey portions of this work,
including maximum multiplicity, lengths of lists, and descriptions of
all lists that occur for various classes of graphs.
This talk is part of the Applied and Computational Analysis series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|