14 citations · 17 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2016
Note on Nordhaus-Gaddum problems for power domination
Katherine F. Benson, Daniela Ferrero, Mary Flagg +3
The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve t…
math.CO2015★ 14 cited
Power domination and zero forcing
Katherine F. Benson, Daniela Ferrero, Mary Flagg +4
The power domination number arises from the monitoring of electrical networks and its determination is an important problem. Upper bounds for power domination numbers can be obtain…
math.CO2012★ 3 cited
The Radio numbers of all graphs of order and diameter
Katherine Benson, Matthew Porter, Maggy Tomova
A radio labeling of a connected graph is a function such that for every two distinct vertices and of $$\text{distance}(u,v)+|c(u)-c(v)|\geq…