44 citations · 263 across the 29 of their papers we have counts for
Showing 2016 · math.COShow all
2 papers · 2 filters
math.CO2016★ 36 cited
A lower bound on the zero forcing number
Randy Davila, Thomas Kalinowski, Sudeep Stephen
In this note, we study a dynamic vertex coloring for a graph . In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time s…
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…