14 citations · 45 across the 12 of their papers we have counts for
Showing 2016 · math.COShow all
2 papers · 2 filters
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.CO2016★ 6 cited
Minimum rank and zero forcing number for butterfly networks
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2
The minimum rank of a simple graph is the smallest possible rank over all symmetric real matrices whose nonzero off-diagonal entries correspond to the edges of . Using t…