Title
Forcing brushes.
Abstract
We give short and simple proofs of the inequalities $B(G)\leq Z(L(G))$ and $Z(G)\leq Z(L(G))$ first established by Erzurumluo\u{g}lu, Meagher, and Pike, where $G$ is a graph without isolated vertices, $B(G)$ is the brushing number of $G$, $Z(G)$ is the zero forcing number of $G$, and $L(G)$ is the line graph of $G$.
Year
DOI
Venue
2019
10.1016/j.dam.2018.10.029
Discrete Applied Mathematics
DocType
Volume
Citations 
Journal
257
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Dirk Meierling15611.55
Dieter Rautenbach2946138.87