Home /  MsriUp /  Schedules /  Exponential Domination in Grids

Exponential Domination in Grids

MSRI-UP 2017: Solving Systems of Polynomial Equations June 24, 2017 - August 06, 2017

July 28, 2017 (01:00 PM PDT - 02:00 PM PDT)
Speaker(s): Michael Young (Carnegie Mellon University)
Location: SLMath: Baker Board Room

Young 7/28/17


Domination in graphs has been an important and active topic in graph theory for over 40 years. It has immediate applications in visibility and controllability. In this talk we will discuss a generalization of domination called exponential dom- ination. A vertex v in an exponential dominating set assigns weight 21−dist(v,u) to vertex u. An exponential dominating set of a graph G is a subset of V (G) such that every vertex in V (G) has been assigned a sum weight of at least 1. We will specifically look at grid graphs and graphs on the torus.

Supplements No Notes/Supplements Uploaded
Video/Audio Files

Young 7/28/17

H.264 Video Young_hb_7-28.mp4 337 MB video/mp4 rtsp://videos.msri.org/data/000/029/093/original/Young_hb_7-28.mp4 Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.