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

有向图及其积的控制

Domination in digraphs and their products

Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall

摘要:

一个有向图$D$的控制(或全控制)集$S$是$D$中的一个顶点集,使得$S$中的顶点的闭(或开)外邻域的并集等于$D$的顶点集。$D$的控制(或全控制)集的最小尺寸是$D$的控制(或全控制)数,记为$γ(D)$(或$γ_t(D)$)。$D$的成对不相交闭(相应地,开)内邻域的最大数目由$ρ(D)$(相应地,$ρ^{\rm o}(D)$)表示。我们证明了在有向图的基础图的围长至少为$7$时,闭(分别为开)的内邻域具有Helly性质,并利用这两个结果证明了在任何有向树$T$(即基础图为树的有向图)中,$γ_t(T)=ρ^{\rm o}(T)$和$γ(T)=ρ(T)$ .利用前一个等式,我们证明了$γ_t(G\times T)=γ_t(G)γ_t(T)$,其中$G$是任意有向图,$T$是任意双树,都没有源顶点,$G\times T$是它们的直积.从等式$γ(T)=ρ(T)$出发,我们导出了有界$γ(G\mathbin{\Box} T)\geγ(G)γ(T)$,其中$G$是任意有向图,$T$是任意有向树,$G\mathbin{\Box} T$是它们的笛卡尔积.在一般的有向图这种Vizing型界失败,但我们证明,对于任何有向图$G$和$H$,其中$γ(G)\geγ(H)$,我们有$γ(G \mathbin{\Box} H) \ge \frac{1}{2}γ(G)(γ(H) + 1)$。这个不等式是尖锐的,证明了一个无限的家庭的例子。研究了具有$γ(T\mathbin{\Box} H)=γ(T)γ(H)$的有向图$T$和有向图$H$.

英文摘要:

A dominating (respectively, total dominating) set $S$ of a digraph $D$ is a set of vertices in $D$ such that the union of the closed (respectively, open) out-neighborhoods of vertices in $S$ equals the vertex set of $D$. The minimum size of a dominating (respectively, total dominating) set of $D$ is the domination (respectively, total domination) number of $D$, denoted $γ(D)$ (respectively,$γ_t(D)$). The maximum number of pairwise disjoint closed (respectively,open) in-neighborhoods of $D$ is denoted by $ρ(D)$ (respectively,$ρ^{\rm o}(D)$). We prove that in digraphs whose underlying graphs have girth at least $7$, the closed (respectively,open) in-neighborhoods enjoy the Helly property, and use these two results to prove that in any ditree $T$ (that is, a digraph whose underlying graph is a tree), $γ_t(T)=ρ^{\rm o}(T)$ and $γ(T)=ρ(T)$. By using the former equality we then prove that $γ_t(G\times T)=γ_t(G)γ_t(T)$, where $G$ is any digraph and $T$ is any ditree, each without a source vertex, and $G\times T$ is their direct product. From the equality $γ(T)=ρ(T)$ we derive the bound $γ(G\mathbin{\Box} T)\geγ(G)γ(T)$, where $G$ is an arbitrary digraph, $T$ an arbitrary ditree and $G\mathbin{\Box} T$ is their Cartesian product. In general digraphs this Vizing-type bound fails, yet we prove that for any digraphs $G$ and $H$, where $γ(G)\geγ(H)$, we have $γ(G \mathbin{\Box} H) \ge \frac{1}{2}γ(G)(γ(H) + 1)$. This inequality is sharp as demonstrated by an infinite family of examples. Ditrees $T$ and digraphs $H$ enjoying $γ(T\mathbin{\Box} H)=γ(T)γ(H)$ are also investigated.

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

↑