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

树木部分免疫

Partial immunization of trees

Mitre C. Dourado, Stefan Ehard, Lucia D. Penso, Dieter Rautenbach

摘要:

对于图$G$和其顶点集上的整数值函数$τ$,动态垄断是$G$的顶点集,使得迭代地将其中至少具有$τ(u)$邻居的$G$的顶点$u$添加到它,最终产生$G$的顶点集。研究了动态垄断系统的最小订单最大化问题,即在满足依赖于顶点的上下界上界的条件下,通过增加各个顶点的门限值,并固定总的增加量来实现最小订单最大化.我们有效地解决了树的这个问题,这扩展了Khoshkhah和Zaker的结果(关于具有给定平均阈值的图的最大动态垄断,加拿大数学公报58(2015)306-316)。

英文摘要:

For a graph $G$ and an integer-valued function $τ$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $τ(u)$ neighbors in it eventually yields the vertex set of $G$. We study the problem of maximizing the minimum order of a dynamic monopoly by increasing the threshold values of individual vertices subject to vertex-dependent lower and upper bounds, and fixing the total increase. We solve this problem efficiently for trees, which extends a result of Khoshkhah and Zaker (On the largest dynamic monopolies of graphs with a given average threshold, Canadian Mathematical Bulletin 58 (2015) 306-316).

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

↑