SEMINAR: Groups and Combinatorics Seminar: Homomorphisms and Endomorphisms of Graphs
|Groups and Combinatorics Seminar: Homomorphisms and Endomorphisms of Graphs
Time and place: 3pm Friday 6 February in Weatherburn LT.
Speaker: Gordon Royle (UWA)
Title: Homomorphisms and Endomorphisms of Graphs.
Abstract: A homomorphism from a graph X to a graph Y is a function f from V(X) to V(Y) that preserves edges (but not necessarily non-edges); if Y = X, then it is called an endomorphism. Just as all the automorphisms of a graph form its automorphism group, all the endomorphisms of a graph form its endomorphism monoid. After covering the background definitions, I will discuss a number of problems that have in common that any solution will rely on understanding - either theoretically or computationally - various aspects of the endomorphisms of the graphs involved.
Fri, 06 Feb 2015 15:00
Fri, 06 Feb 2015 16:00
Gabriel Verret <[email protected]>
Wed, 04 Feb 2015 13:59
- Locations of venues on the Crawley and Nedlands campuses are
available via the Campus Maps website.
- Download this event as:
Mail this event: