跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 20:16 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 20:29 — 2026-11-19 20:29(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 20:16最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 20:10(北京时间)
新论文 · v1arXiv:2611.21210

Full-Cover and Non-Overlapping Uni-domination in Graphs: Bounds and Complexity

Florent Foucaud, Yan Gerard, Christian Laforest, Le Vu Pham

原文摘要

A vertex is uni-dominated by a set $S \subseteq V(G)$ if exactly one vertex of $S$ lies in its closed neighborhood, and the uni-domination number $\mathrm{ud}^*(G)$ is the largest number of vertices a single set can uni-dominate. The graphs admitting an efficient dominating set are those with $\mathrm{ud}^*(G) = n$. Hedetniemi and Rall asked for the largest constant $c$ with $\mathrm{ud}^*(T) \geq c \cdot n$ for every tree $T$ of order $n$. We answer their question: the constant is $4/5$, and a set attaining it can be computed in linear time. This set is moreover a dominating set. Recall that an efficient dominating set satisfies two requirements at once: it dominates every vertex, and it dominates no vertex twice. Our set satisfies the first one, which leads us to study $\mathrm{ud}^*$ under each of the two requirements separately, giving the Full-Cover variant $\mathrm{ud}^*_0$ and the Non-Overlapping variant $\mathrm{ud}^*_+$. The two behave very differently: on arbitrarily large graphs $\mathrm{ud}^*_0$ may remain bounded by a constant, whereas $\mathrm{ud}^*_+$ always grows with the order. We present bounds for both, and show that the associated decision problems are polynomial for constant thresholds and NP-complete for the thresholds $\lceil \sqrt[c]{n} \rceil$ and $4\sqrt{n}$, respectively, the latter even on split graphs. Finally, we show that neither of the two parameters bounds the other.

cs.DM · math.CO