Abstract: The metric dimension of a graph represents the minimum number of cell towers needed to be placed among the vertices of a graph such that any unknown location can be uniquely determined using only its distances to each of the cell towers. We introduce the radius of location of graphs, which correspondingly represents the minimum possible "strength" of the cell towers over all optimal layouts of the towers. In particular, a cell tower cannot distinguish two locations if they are outside of the range of that tower. We give some results for general graphs, and then we analyze several specific families of graphs, with an emphasis on trees. This is joint work with Danny Dyer and Melissa Huggan.

---

Location: A-1046

Date and Time: Thursday, May. 14 at 03:00 PM - 04:00 PM (NDT)

---