arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.06496math.CO
收藏

树中的总强迫集

Total Forcing Sets in Trees

Randy Davila, Michael Henning

摘要:

图$G$的顶点的动态着色从着色顶点的初始子集$S$开始,所有剩余的顶点是未着色的。在每个离散时间间隔,一个着色顶点与恰好一个非着色邻居迫使这个非着色邻居着色。初始集合$S$被称为$G$的强制集合,如果通过迭代地应用强制过程,$G$中的每个顶点都被着色。如果初始集$S$具有导出$G$的无孤立点子图的附加性质,则称$S$为$G$的全强制集.在$G$中,总强迫集的最小基数是它的总强迫数,记为$F_t(G)$。我们证明了如果$T$是一棵树的顺序$n \ge 3$的最大程度~ $Δ$,那么$F_t(T) \le \frac{1}Δ((Δ- 1)n + 1)$,我们刻画了无限族的树达到平等在这个界限。我们还证明了,如果$T$是一个非平凡树的$n_1$叶,那么$F_t(T) \ge n_1$,我们的特点是无限家庭的树实现平等在这个界限。作为这个结果的结果,一个非平凡树的总强迫数严格大于它的强迫数。特别是,我们证明,如果$T$是一个非平凡的树,那么$F_t(T) \ge F(T)+1$,我们的特点极值树实现这一界限。

英文摘要:

A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set $S$ is called a forcing set of $G$ if, by iteratively applying the forcing process, every vertex in $G$ becomes colored. If the initial set $S$ has the added property that it induces a subgraph of $G$ without isolated vertices, then $S$ is called a total forcing set in $G$. The minimum cardinality of a total forcing set in $G$ is its total forcing number, denoted $F_t(G)$. We prove that if $T$ is a tree of order $n \ge 3$ with maximum degree~$Δ$, then $F_t(T) \le \frac{1}Δ((Δ- 1)n + 1)$, and we characterize the infinite family of trees achieving equality in this bound. We also prove that if $T$ is a non-trivial tree with $n_1$ leaves, then $F_t(T) \ge n_1$, and we characterize the infinite family of trees achieving equality in this bound. As a consequence of this result, the total forcing number of a non-trivial tree is strictly greater than its forcing number. In particular, we prove that if $T$ is a non-trivial tree, then $F_t(T) \ge F(T)+1$, and we characterize extremal trees achieving this bound.

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

↑