2022
DOI: 10.1016/j.dam.2021.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Localization game for random graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…The metric dimension was also studied for the G(n, p) model. The statements of the bounds for β(G) with G ∈ G(n, p) obtained in [2] are slightly technical, but the following observations can be made: for sparser graphs (that is, graphs of diameter at least three a.a.s., which corresponds to i ≥ 2 in the discussion below), it follows from [2] and [10]…”
Section: Related Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The metric dimension was also studied for the G(n, p) model. The statements of the bounds for β(G) with G ∈ G(n, p) obtained in [2] are slightly technical, but the following observations can be made: for sparser graphs (that is, graphs of diameter at least three a.a.s., which corresponds to i ≥ 2 in the discussion below), it follows from [2] and [10]…”
Section: Related Resultsmentioning
confidence: 99%
“…was studied in [11]. The bounds for dense graphs were consecutively improved in [10], and the arguments were extended to sparse graphs.…”
Section: Related Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The localization number of graph products was considered in [13], and in diameter 2 graphs such as Kneser, Moore, and polarity graphs in [6]. Localization was studied in random binomial graphs in [19,20] and in random geometric graphs in [25].…”
Section: Introductionmentioning
confidence: 99%