强制刷

摘要：

本文给出了Erzurumluo Lu，Meagher和Pike首先建立的不等式$B(G)\leq Z(L(G))$和$Z(G)\leq Z(L(G))$的简短证明，其中$G$是一个无孤立点的图，$B(G)$是$G$的刷数，$Z(G)$是$G$的迫零数，$L(G)$是$G$的线图.

英文摘要：

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ğ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$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。