论文标题
在零强迫图形的互补数中使用禁止子图
On the zero forcing number of the complement of graphs with forbidden subgraphs
论文作者
论文摘要
在某种程度上观察到，在$ n $顶点上补充树的零强制数是$ n-3 $或$ n-1 $的零强制数，我们认为在某些条件下，尤其是那些不包含完整的biptite子图的情况下，我们认为更通用图的互补的零强制数。我们还远远超出了树木，并完全研究了所有可能的零强迫数字，以供单周期图和仙人掌图的补充。
Motivated in part by an observation that the zero forcing number for the complement of a tree on $n$ vertices is either $n-3$ or $n-1$ in one exceptional case, we consider the zero forcing number for the complement of more general graphs under some conditions, particularly those that do not contain complete bipartite subgraphs. We also move well beyond trees and completely study all of the possible zero forcing numbers for the complements of unicyclic graphs and cactus graphs.
