Atlantic Graph Theory Seminar

Speaker: Iain Beaton, Acadia University

Title: Reconfiguring minimal dominating sets under a generalization of token sliding

A dominating set S in a graph is a subset of vertices such that every vertex is either in S or adjacent to a vertex in S. A minimal dominating set M is a dominating set such that M −v is not a dominating set for all v ∈ M. In this talk we introduce a reconfiguration graph R(G) for minimal dominating sets under a generalization of the token sliding model. We give some preliminary results which include showing that R(G) is connected for trees and split graphs. Additionally we classify all graphs which have complete or empty reconfiguration graphs.

Zoom link:

Meeting ID: 868 6149 9971

Passcode: 325258