A note on the localization number of random graphs: Diameter two case
A note on the localization number of random graphs: Diameter two case
复制标题
关于随机图定位数的注记:直径二情况
DOI:
10.1016/j.dam.2018.06.006
复制
发表时间:
2019
影响因子:
1.1
通讯作者:
Pegden, Wesley
中科院分区:
文献类型:
--
作者:
Dudek, Andrzej;Frieze, Alan;Pegden, Wesley
We study the localization game on dense random graphs. In this game, a cop x tries to locate a robber y by asking for the graph distance of y from every vertex in a sequence of sets W 1, W 2,…, W ℓ. We prove high probability upper and lower bounds for the minimum size of each W i that will guarantee that x will be able to locate y.
登录
查看更多内容
影响因子:
1.1
作者:
James M. Carraher;Ilkyoo Choi;Michelle Delcourt;Lawrence H. Erickson;D. West
通讯作者:
D. West
影响因子:
0.7
作者:
B. Bollobás;D. Mitsche;P. Prałat
通讯作者:
P. Prałat
影响因子:
0.8
作者:
J. Haslegrave;Richard A. B. Johnson;Sebastian Koch
通讯作者:
Sebastian Koch
影响因子:
1.1
作者:
B. Bosek;Przemysław Gordinowicz;J. Grytczuk;Nicolas Nisse;Joanna Sokól;Małgorzata Śleszyńska
通讯作者:
Małgorzata Śleszyńska
影响因子:
0.8
作者:
Suzanne M. Seager
通讯作者:
Suzanne M. Seager