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.

Institutional Accreditation:

The University of Louisville is accredited by the Commission on Colleges of the Southern Association of Colleges and Schools to award associate, bachelor, master, specialist, doctoral, and first-professional degrees (D.M.D., J.D., M.D.). Individuals who wish to contact the Commission on Colleges regarding the accreditation status of the university may write the Commission at 1866 Southern Lane, Decatur, Georgia 30033-4097, or call (404) 679-4500. See Accreditation Confirmation Letter for more Information.

University of Louisville, Department of Mathematics.
Copyright © 2015. All rights reserved.
Comments to