Title: Some constructions of integral graphs
| Speaker: | Harmony Zhan |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
Door will open at 4:15pm. As usual we will have 15 mins for socializing and for eating pizza before the talk starts (at 4:30pm sharp).
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Integral graphs are very rare and difficult to find. In this paper, we introduce some general methods for constructing such graphs. As a consequence, some infinite families of integral graphs are obtained.
The
presentation
will
be
based
on
the
following
manuscript:
http://math.ipm.ac.ir/~tayfeh-r/papersandpreprints/IntegralGraph.pdf
For
more
information
about
our
reading
group,
please
visit
our
webpage
http://www.math.uwaterloo.ca/~k2georgi/reading.htm