跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21210 · v1

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

首次提交 2026-11-16 23:02
版本更新 2026-11-16 23:02
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

A vertex is uni-dominated by a set S⊆V(G)S \subseteq V(G) if exactly one vertex of SS lies in its closed neighborhood, and the uni-domination number ud∗(G)\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 ud∗(G)=n\mathrm{ud}^*(G) = n. Hedetniemi and Rall asked for the largest constant cc with ud∗(T)≥c⋅n\mathrm{ud}^*(T) \geq c \cdot n for every tree TT of order nn. We answer their question: the constant is 4/54/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 ud∗\mathrm{ud}^* under each of the two requirements separately, giving the Full-Cover variant ud0∗\mathrm{ud}^*_0 and the Non-Overlapping variant ud+∗\mathrm{ud}^*_+. The two behave very differently: on arbitrarily large graphs ud0∗\mathrm{ud}^*_0 may remain bounded by a constant, whereas ud+∗\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 ⌈nc⌉\lceil \sqrt[c]{n} \rceil and 4n4\sqrt{n}, respectively, the latter even on split graphs. Finally, we show that neither of the two parameters bounds the other.

作者备注:23 pages, 5 figures. Appears in the Proceedings of the 52nd International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 2027)

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 23:02 · 最新观测版本

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

A vertex is uni-dominated by a set S⊆V(G)S \subseteq V(G) if exactly one vertex of SS lies in its closed neighborhood, and the uni-domination number ud∗(G)\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 ud∗(G)=n\mathrm{ud}^*(G) = n. Hedetniemi and Rall asked for the largest constant cc with ud∗(T)≥c⋅n\mathrm{ud}^*(T) \geq c \cdot n for every tree TT of order nn. We answer their question: the constant is 4/54/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 ud∗\mathrm{ud}^* under each of the two requirements separately, giving the Full-Cover variant ud0∗\mathrm{ud}^*_0 and the Non-Overlapping variant ud+∗\mathrm{ud}^*_+. The two behave very differently: on arbitrarily large graphs ud0∗\mathrm{ud}^*_0 may remain bounded by a constant, whereas ud+∗\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 ⌈nc⌉\lceil \sqrt[c]{n} \rceil and 4n4\sqrt{n}, respectively, the latter even on split graphs. Finally, we show that neither of the two parameters bounds the other.

查看此版本解读 →查看此版本原文 ↗