Mathematics & Statistics Colloquium Series
Fall 2003-Spring 2004
The Mathematics and Statistics Department
at Murray State University hosts a colloquium series each semester.
Approximately every two weeks, invited speakers give a talk on some aspect of
mathematics and/or statistics. The colloquia are intended for a general
mathematical audience, and many of the talks are accessible to undergraduate
students. Speakers in the past have included faculty members from both Murray
State and other universities throughout the U.S. and the world, and Murray
State students (undergraduate and graduate). Refreshments are served prior to
the talk. We hope to see you there!
Colloquia are typically held on either Monday or Friday afternoons in Faculty Hall 309.
![]()
Hope McIlwain (Mercer University)
Can you hear the size of the vertices? An inverse spectral problem of Laplacians on weighted graphs
Let $G$ be a simple graph on $n$
vertices. We will define a Laplacian $\Delta$
on $G$ which depends on an assignment of a weight to each vertex of $G$. \ In
this situation, one eigenvalue will always be zero. \ We fix the remaining
$(n-1)$ eigenvalues. We then ask for which graphs we can find a set of weights
which generate a Laplacian with the desired spectrum. In particular, we will
demonstrate that we can always solve the inverse spectral problem for a
three-vertex graph and we will also give a proof that we can always solve the
inverse spectral problem for $K_{4}$, the complete graph on four vertices.
Questions about this page? Please contact Chris Mecklin or Ted Porter.