Maximum Nullity and Forcing Number on Graphs with Maximum Degree at most Three

Meysam Alishahi, Elahe Rezaei-Sani, Elahe Sharifi

A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $F$ of colored vertices, with all remaining vertices being non-colored. At each time step, a colored…