Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
复制标题
周长至少为五的连通图中的度比例阈值和树的动态垄断
DOI:
10.1016/j.tcs.2016.12.028
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
D. Rautenbach
中科院分区:
文献类型:
--
作者:
M. Gentner;D. Rautenbach
Let G be a graph, and let ρ∈[0, 1]. For a set D of vertices of G, let the set H ρ (D) arise by starting with the set D, and iteratively adding further vertices u to the current set if they have at least⌈ ρ d G (u)⌉ neighbors in it. If H ρ (D) contains all vertices of G, then D is known as an irreversible dynamic monopoly or a perfect target set associated with the threshold function u↦⌈ ρ d G (u)⌉. Let h ρ (G) be the minimum cardinality of such an irreversible dynamic monopoly. For a connected graph G of maximum degree at least 1 ρ, Chang showed h ρ (G)≤ 5.83 ρ n (G), which was improved by Chang and Lyuu to h ρ (G)≤ 4.92 ρ n (G). We show that for every ϵ> 0, there is some ρ (ϵ)∈(0, 1) such that h ρ (G)≤(2+ ϵ) ρ n (G) for every ρ in (0, ρ (ϵ)), and every connected graph G that has maximum degree at least 1 ρ and girth at least 5. Furthermore, we show that h ρ (T)≤ ρ n (T) for every ρ in (0, 1], and every tree T that has order at least 1 ρ.
登录
查看更多内容
影响因子:
1.1
作者:
S. Brunetti;E. Lodi;Walter Quattrociocchi
通讯作者:
Walter Quattrociocchi
DOI:
--
发表时间:
2007
期刊:
J. Comb. Theory B
影响因子:
--
作者:
Joseph Lauer;N. Wormald
通讯作者:
N. Wormald
影响因子:
1.1
作者:
Sarah Spence Adams;Paul Booth;Denise Sakai Troxell;Harold Jaffe
通讯作者:
Harold Jaffe
DOI:
--
发表时间:
2008
期刊:
Bonn Workshop of Combinatorial Optimization
影响因子:
--
作者:
L. Margulis
通讯作者:
L. Margulis
DOI:
10.1016/j.dam.2008.09.012
发表时间:
2009
期刊:
Discret. Appl. Math.
影响因子:
--
作者:
Paul A. Dreyer;F. Roberts
通讯作者:
F. Roberts