Intermountain Section of the MAA Winter 2021 Conference - Talk

Title: Nordhaus-Gaddum Problems for Power Domination

Speaker(s): Violeta Vasilevska

Abstract: Power domination is a process on a graph that consists of finding a minimum set of vertices by following certain rules. At the end of this process, all vertices in the graph are ‘observed’ (‘colored’ with the same color).

In this talk we show how this process works and then discuss the Nordhaus-Gaddum problem for power domination. Then a few upper Nordhaus-Gaddum bounds for particular graphs will be discussed.

This is a joint work with several co-authors (REUF research group 2015 - the paper containing these results can be found on the arXiv).

Big View 2021 MAA Intermountain Section Meeting
HomePage Registration Plenary Speakers Abstract Submission Schedule Student Competition Business Meeting	Title: Nordhaus-Gaddum Problems for Power Domination Speaker(s): Violeta Vasilevska Abstract: Power domination is a process on a graph that consists of finding a minimum set of vertices by following certain rules. At the end of this process, all vertices in the graph are ‘observed’ (‘colored’ with the same color). In this talk we show how this process works and then discuss the Nordhaus-Gaddum problem for power domination. Then a few upper Nordhaus-Gaddum bounds for particular graphs will be discussed. This is a joint work with several co-authors (REUF research group 2015 - the paper containing these results can be found on the arXiv).
Page last modified on March 22, 2021, at 05:15 PM