TAR模型中控制集之间的线性变换
Linear transformations between dominating sets in the TAR-model
摘要:
给定图$G$和整数$k$,大小至多为$k$的两个控制集$D_{\sf s}$和$D_{\sf t}$之间的令牌添加和移除(简称{ \sf TAR})重构序列是$G$的控制集的序列$S= \langle D_0 = D_{\sf s}, D_1 \ldots, D_\ell = D_{\sf t} \rangle$,使得任何两个连续的控制集相差一个顶点的添加或删除,并且没有控制集的大小大于$k$。我们首先改进了Haas和Seyffarth的一个结果,证明了如果$k=Γ(G)+α(G)-1$(其中$Γ(G)$是最小控制集的最大尺寸,$α(G)$是独立集的最大尺寸),则在任意一对控制集之间存在线性{ \sf TAR}重构序列.然后,我们改进了这些结果的几个图形类显示,同样适用于$K_{\ell}$ -小自由图只要$k \ge Γ(G)+O(\ell \sqrt{\log \ell})$和平面图每当$k \ge Γ(G)+3$。最后,证明了如果$k=Γ(G)+tw(G)+1$,则任意一对控制集之间也存在线性变换.
英文摘要:
Given a graph $G$ and an integer $k$, a token addition and removal ({\sf TAR} for short) reconfiguration sequence between two dominating sets $D_{\sf s}$ and $D_{\sf t}$ of size at most $k$ is a sequence $S= \langle D_0 = D_{\sf s}, D_1 \ldots, D_\ell = D_{\sf t} \rangle$ of dominating sets of $G$ such that any two consecutive dominating sets differ by the addition or deletion of one vertex, and no dominating set has size bigger than $k$. We first improve a result of Haas and Seyffarth, by showing that if $k=Γ(G)+α(G)-1$ (where $Γ(G)$ is the maximum size of a minimal dominating set and $α(G)$ the maximum size of an independent set), then there exists a linear {\sf TAR} reconfiguration sequence between any pair of dominating sets. We then improve these results on several graph classes by showing that the same holds for $K_{\ell}$-minor free graph as long as $k \ge Γ(G)+O(\ell \sqrt{\log \ell})$ and for planar graphs whenever $k \ge Γ(G)+3$. Finally, we show that if $k=Γ(G)+tw(G)+1$, then there also exists a linear transformation between any pair of dominating sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。