Wednesday, September 23, 2015 3:30 pm
-
3:30 pm
EDT (GMT -04:00)
Title: Linear algebra+graph theory=FUN!!
| Speaker: | John Sinkovic |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
The
adjacency
matrix
and
the
Laplacian
matrix
are
part
of
a
large
family
of
real
symmetric
matrices
associated
with
a
simple
graph.
The
off-diagonal
zero/nonzero
pattern
of
a
matrix
in
the
family
corresponds
to
the
absence/presence
of
edges
in
the
graph.
One
of
the
more
interesting
developments
using
this
family
of
matrices
is
the
Colin
de
Verdiere
graph
parameter.
In
1990,
Yves
Colin
de
Verdiere
introduced
a
graph
parameter
whose
value
determines
whether
a
graph
is
outerplanar,
planar,
or
linklessly
embeddable.
I
will
share
some
of
the
recent
questions
that
have
been
asked
about
these
sets
of
matrices
corresponding
to
a
graph.