arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.07414math.COcs.DM
收藏

弱Toll凸性中的壳数和区间数的计算

Computing the hull and interval numbers in the weakly toll convexity

Mitre C. Dourado, Marisa Gutierrez, Fábio Protti, Silvia Tondato

摘要:

图$G$的行走$u_0u_1 \ldots u_{k-1}u_k$是\textit{weakly toll walk},如果$u_0u_k \not\in E(G)$,$u_0u_i \in E(G)$蕴涵$u_i = u_1$,并且$u_ju_k\in E(G)$蕴涵$u_j=u_{k-1}$。集合$S \subseteq V(G)$的{ \em弱收费区间}记为$I(S)$,由$S$和属于$S$的两个顶点之间的某个弱收费行走的顶点构成.如果$I(S) = S$,则设置$S$是{ \it弱凸}。$S$的{ \em弱toll凸包},记为$H(S)$,是包含$S$的最小弱toll凸集. $G$的{ \em弱收费区间数}是集合$S \subseteq V(G)$的最小基数,使得$I(S) = V(G)$ ;并且$G$的{ \em弱收费外壳数}是集合$S \subseteq V(G)$的最小基数,使得$H(S) = V(G)$。在这项工作中,我们展示了如何计算弱收费区间和弱收费壳数的图在多项式时间。与此相反,我们发现,确定图$G$的弱收费凸数(最大弱收费凸集的大小不同于$V(G)$)是\NP -硬。

英文摘要:

A walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly toll walk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. The {\em weakly toll interval} of a set $S \subseteq V(G)$, denoted by $I(S)$, is formed by $S$ and the vertices belonging to some weakly toll walk between two vertices of $S$. Set $S$ is {\it weakly toll convex} if $I(S) = S$. The {\em weakly toll convex hull} of $S$, denote by $H(S)$, is the minimum weakly toll convex set containing $S$. The {\em weakly toll interval number} of $G$ is the minimum cardinality of a set $S \subseteq V(G)$ such that $I(S) = V(G)$; and the {\em weakly toll hull number} of $G$ is the minimum cardinality of a set $S \subseteq V(G)$ such that $H(S) = V(G)$. In this work, we show how to compute the weakly toll interval and the weakly toll hull numbers of a graph in polynomial time. In contrast, we show that determining the weakly toll convexity number of a graph $G$ (the size of a maximum weakly toll convex set distinct from $V(G)$) is \NP-hard.

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

↑