Algebra & Combinatorics Seminar 11/15/18

"Enumeration of Uniquely Pressable Graphs"

Dr. Wildstrom

Thursday, November 15 in NS333 at 10AM

Abstract: In a graph where vertices are "marked" or "unmarked", a process similar to the classic "Lights Out" game can be performed, by toggling the marked state and mutual adjacency of all vertices in a closed neighborhood of a marked vertex, with the goal of removing all edges and unmarking all vertices. On a certain small family of graphs, this process has a unique solution. Following a question posed by Josh Cooper, we discuss techniques for both enumerating these graphs and generating them by several iterative processes. This project is joint work with Adam Jobson.