10 citations · 19 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 10 cited
On walk-regular graphs and graphs with symmetric hitting times
Agelos Georgakopoulos
Aldous [1] asked whether every graph in which the distribution of the return time of random is independent of the starting vertex must be transitive. We remark that this question c…
math.CO2012★ 9 cited
A Tractable Variant of Cover Time
Agelos Georgakopoulos
We introduce a variant of the cover time of a graph, called cover cost, in which the cost of a step is proportional to the number of yet uncovered vertices. It turns out that cover…