Name
Abstract | ||
|---|---|---|
A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in O(loglogn), where n is the number of nodes. This is an exponential improvement on the previously best known upper bound of O(logn). We then generalize the result to products of nonsplit graphs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2020.02.013 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Information dissemination,Dynamic networks,Graph radius | Journal | 282 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Függer | 1 | 167 | 21.14 |
| Thomas Nowak | 2 | 32 | 9.18 |
| Kyrill Winkler | 3 | 6 | 4.15 |