School Seminars and Colloquia

Cores of vertex-transitive graphs

Discrete Structures and Algorithms (Seminar)

by Ricky Rotheram


Institution: Department of Mathematics and Statistics, The University of Melbourne
Date: Tue 2nd March 2010
Time: 1:15 PM
Location: Room 215, Richard Berry Building, The University of Melbourne

Abstract: A homomorphism of two graphs X and Y is a map between the vertex sets V(X) and V(Y) such that f(x) is adjacent to f(y) in Y whenever x and y are adjacent in X. Examples include automorphisms, isomorphisms and retractions, which are homomorphisms from a graph to one of its induced subgraphs (known as a retract). In this talk I will outline my proposed research project, which is to investigate the cores (minimal retracts) of some families of cayley graphs, and will summarise the existing results for the cores of vertex-transitive graphs.

For More Information: contact Sanming Zhou email sanming@unimelb.edu.au OR David Wood email woodd@unimelb.edu.au