Department of Mathematics and Statistics Abstract

"Domination...in all its graphic detail"
by Daryl Findley, John McKenzie and Ben Phillips, WMU

Abstract: You are the campaign manager for the Republican Party in an election. Due to a particularly close election all of the ballots are to be recounted by hand at a number of different tables in a room. To ensure a proper recount you want there to be a Republican observing each table. A single observer can view several tables at once, and to save money [for a future tax cut] you wish to use as few observers as possible while not leaving any table unobserved. The room and tables can be modeled with a graph and the problem of positioning the observers using an area of graph theory called domination. In this talk we shall discuss graph theory, domination theory, and some recent work we have done on domination in regular graphs.